Add to ORKGInternational audienceIn this work we consider the well-known one-machine total completion time sequencing problem subject to release times. We present a very large scale neighborhood search heuristic based on mathematical programming. This heuristic makes use of the positional completion time formulation of the problem in which valid inequalities are added. The proposed procedure compares favorably with the state of the art heuristics
International audienceWe study the one-machine scheduling problem with release dates and we look at ...
This paper considers a single machine scheduling problem of minimizing makespan (Cmax) which takes ...
We consider the problem of minimizing the sum of completion times in a two-machine permutation flows...
International audienceIn this work we consider the well-known one-machine total completion time sequ...
International audienceIn this work we consider the well-known one-machine total completion time sequ...
Abstract: This study considers the scheduling problem of minimizing the total completion time on a s...
19 pages, 4 figuresIn this paper, we focus on the solution of a hard single machine scheduling probl...
In this paper, the problem of minimizing the total completion time on a single machine with the pres...
International audienceIn this study, we consider the single machine scheduling problem with release ...
International audienceThis paper addresses a semi-online setting of the minimization of the total co...
We consider the problem of scheduling jobs with release dates and sequence-dependent processing time...
AbstractEach of n jobs is to be processed without interruption on a single machine which can handle ...
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
The present work considers the reduction of the mean completion time and the makespan in the single ...
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
International audienceWe study the one-machine scheduling problem with release dates and we look at ...
This paper considers a single machine scheduling problem of minimizing makespan (Cmax) which takes ...
We consider the problem of minimizing the sum of completion times in a two-machine permutation flows...
International audienceIn this work we consider the well-known one-machine total completion time sequ...
International audienceIn this work we consider the well-known one-machine total completion time sequ...
Abstract: This study considers the scheduling problem of minimizing the total completion time on a s...
19 pages, 4 figuresIn this paper, we focus on the solution of a hard single machine scheduling probl...
In this paper, the problem of minimizing the total completion time on a single machine with the pres...
International audienceIn this study, we consider the single machine scheduling problem with release ...
International audienceThis paper addresses a semi-online setting of the minimization of the total co...
We consider the problem of scheduling jobs with release dates and sequence-dependent processing time...
AbstractEach of n jobs is to be processed without interruption on a single machine which can handle ...
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
The present work considers the reduction of the mean completion time and the makespan in the single ...
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
International audienceWe study the one-machine scheduling problem with release dates and we look at ...
This paper considers a single machine scheduling problem of minimizing makespan (Cmax) which takes ...
We consider the problem of minimizing the sum of completion times in a two-machine permutation flows...