Minimizing total completion time in two-machine flow shops with exact delays

We study the problem of minimizing total completion time in the two-machine flow shop with exact delay model. This problem is a generalization of the no-wait flow shop problem which is known to be strongly NP-hard. Our problem has many applications but little results are given in the literature so far. We focus on permutation schedules. We first prove that some simple algorithms can be used to find the optimal schedules for some special cases. Then for the general case, we design some heuristics as well as metaheuristics whose performance are shown to be very well by computational experiments.

[1]  A. Ageev,et al.  Approximation Algorithms for Scheduling Problems with Exact Delays , 2006, WAOA.

[2]  Chelliah Sriskandarajah,et al.  Some no-wait shops scheduling problems: Complexity aspect , 1986 .

[3]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[4]  Chuen-Lung Chen,et al.  Genetic algorithms applied to the continuous flow shop problem , 1996 .

[5]  Teofilo F. Gonzalez,et al.  Unit Execution Time Shop Problems , 1982, Math. Oper. Res..

[6]  Christos H. Papadimitriou,et al.  Flowshop scheduling with limited temporary storage , 1980, JACM.

[7]  D. Chaudhuri,et al.  Heuristic algorithms for continuous flow-shop problem , 1990 .

[8]  Stefan Voß,et al.  Solving the continuous flow-shop scheduling problem by metaheuristics , 2003, Eur. J. Oper. Res..

[9]  Hans Röck,et al.  Some new results in flow shop scheduling , 1984, Z. Oper. Research.

[10]  René van Dal,et al.  Solvable Cases of the No-Wait Flow-Shop Scheduling Problem , 1991 .

[11]  Han Hoogeveen,et al.  Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard , 2004, J. Sched..

[12]  D. Pohoryles,et al.  Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .

[13]  Joseph Y.-T. Leung,et al.  Scheduling Two-Machine Flow shops with Exact Delays , 2007, Int. J. Found. Comput. Sci..

[14]  K. R. Baker,et al.  Minimizing Mean Flowtime in the Flow Shop with No Intermediate Queues , 1974 .

[15]  Alexander A. Ageev,et al.  Approximation Algorithms for Scheduling Problems , 2009, Introduction to Scheduling.

[16]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[17]  Wlodzimierz Szwarc,et al.  A note on the flow‐shop problem without interruptions in job processing , 1981 .

[18]  J. Gupta.  Optimal flowshop schedules with no intermediate storage space , 1976 .