We study the improvement of non-permutation over permutation schedules in flow shops when minimizing the total completion time. We solve both problems by a two-phase heuristic. The first phase uses an iterated local search to find a good permutation schedule. The second phase explores non-permutation schedules using an effective insertion neighborhood, that permits to anticipate or delay a job when passing from one machine to the next. In computational experiments we show that both phases yield state-of-the-art results. We find that allowing non-permutation schedules can reduce the total completion considerably with a moderate extra effort, and without increasing the buffer size needed during processing. We conclude that non-permutation sch...
International audienceThe no-wait flowshop scheduling problem is a variant of the classical permutat...
In this paper, we address the problem of scheduling jobs in a no-wait flowshop with the objective of...
In this paper, we address the problem of sequencing jobs in a permutation flow shop with the objecti...
In this paper a three steps heuristic for the permutation flow shop problem is proposed. The objecti...
This paper addresses the problem of scheduling jobs in a permutation flowshop with the objective of ...
In this paper, we study the resolution of a permutation flow shop problem with sequence-independent ...
This work deals with the permutation flow-shop scheduling problem with and without storage space be...
This work deals with the permutation flow-shop scheduling problem with and without storage space bet...
A variety of metaheuristics have been developed to solve the permutation flow shop problem minimizin...
This is a pre-publication author manuscript of the final, published article. This Article is brought...
<p>In this article, the issue of production scheduling in a no-idle flowshop environment is addresse...
The paper compares the schedules of different variants of the flow shop problem, i.e. permutation, n...
The paper compares the schedules of different variants of the flow shop problem, i.e. permutation, n...
The paper compares the schedules of different variants of the flow shop problem, i.e. permutation, n...
We consider the No-idle Permutation Flowshop Scheduling Problem (NPFSP) with a total tardiness crite...
International audienceThe no-wait flowshop scheduling problem is a variant of the classical permutat...
In this paper, we address the problem of scheduling jobs in a no-wait flowshop with the objective of...
In this paper, we address the problem of sequencing jobs in a permutation flow shop with the objecti...
In this paper a three steps heuristic for the permutation flow shop problem is proposed. The objecti...
This paper addresses the problem of scheduling jobs in a permutation flowshop with the objective of ...
In this paper, we study the resolution of a permutation flow shop problem with sequence-independent ...
This work deals with the permutation flow-shop scheduling problem with and without storage space be...
This work deals with the permutation flow-shop scheduling problem with and without storage space bet...
A variety of metaheuristics have been developed to solve the permutation flow shop problem minimizin...
This is a pre-publication author manuscript of the final, published article. This Article is brought...
<p>In this article, the issue of production scheduling in a no-idle flowshop environment is addresse...
The paper compares the schedules of different variants of the flow shop problem, i.e. permutation, n...
The paper compares the schedules of different variants of the flow shop problem, i.e. permutation, n...
The paper compares the schedules of different variants of the flow shop problem, i.e. permutation, n...
We consider the No-idle Permutation Flowshop Scheduling Problem (NPFSP) with a total tardiness crite...
International audienceThe no-wait flowshop scheduling problem is a variant of the classical permutat...
In this paper, we address the problem of scheduling jobs in a no-wait flowshop with the objective of...
In this paper, we address the problem of sequencing jobs in a permutation flow shop with the objecti...