A heuristic for minimizing the makespan in no-idle permutation flow shops

The paper deals with the problem of finding a job sequence that minimizes the makespan in m-machine flow shops under the no-idle condition. This condition requires that each machine must process jobs without any interruption from the start of processing the first job to the completion of processing the last job. Since the problem is NP-hard, we propose a constructive heuristic for solving it that significantly outperforms heuristics known so far.

[1]  Jose M. Framiñan,et al.  A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..

[2]  Józef Grabowski,et al.  Some local search algorithms for no-wait flow-shop problem with makespan criterion , 2005, Comput. Oper. Res..

[3]  Jerzy Kamburowski,et al.  More on three-machine no-idle flow shops , 2004, Comput. Ind. Eng..

[4]  Eugeniusz Nowicki,et al.  The permutation flow shop with buffers: A tabu search approach , 1999, Eur. J. Oper. Res..

[5]  Mohamed Moalla,et al.  The simple F2/ /Cmax with forbidden tasks in first or last position: A problem more complex that it seems , 2005, Eur. J. Oper. Res..

[6]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[7]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[8]  Mohamed Haouari,et al.  A computational study of the permutation flow shop problem based on a tight lower bound , 2005, Comput. Oper. Res..

[9]  Alain Guinet,et al.  Three stage no-idle flow-shops , 2003 .

[10]  Alain Guinet,et al.  A travelling salesman approach to solve the F , 2005, Eur. J. Oper. Res..

[11]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[12]  Débora P. Ronconi,et al.  A note on constructive heuristics for the flowshop problem with blocking , 2004 .

[13]  F. James,et al.  RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Lüscher , 1994 .

[14]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

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