An improved NEH heuristic to minimize makespan in permutation flow shops

For over 20 years the NEH heuristic of Nawaz, Enscore, and Ham [A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, The International Journal of Management Science 1983;11:91-5] has been commonly regarded as the best heuristic for solving the NP-hard problem of minimizing the makespan in permutation flow shops. The strength of NEH lies mainly in its priority order according to which jobs are selected to be scheduled during the insertion phase. Framinan et al. [Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idle time or flowtime in the static permutation flowshop problem. International Journal of Production Research 2003;41:121-48] presented the results of an extensive study to conclude that the NEH priority order is superior to 136 different orders examined. Based upon the concept of Johnson's algorithm, we propose a new priority order combined with a simple tie-breaking method that leads to a heuristic that outperforms NEH for all problem sizes.

[1]  Chris N. Potts,et al.  Permutation vs. non-permutation flow shop schedules , 1991, Oper. Res. Lett..

[2]  Wlodzimierz Szwarc.  Mathematical aspects of the 3 × n job‐shop sequencing problem , 1974 .

[3]  Sergey Vasil'evich Sevast'janov,et al.  Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops , 1995, Math. Oper. Res..

[4]  A. S. Spachis,et al.  Heuristics for flow-shop scheduling , 1980 .

[5]  Scott Turner,et al.  Comparison of heuristics for flow shop sequencing , 1987 .

[6]  Marcelo Seido Nagano,et al.  A high quality solution constructive heuristic for flow shop sequencing , 2002, J. Oper. Res. Soc..

[7]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, 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]  Maxim Sviridenko.  A Note on Permutation Flow Shop Problem , 2004, Ann. Oper. Res..

[10]  Ravi Shankar,et al.  A neuro-tabu search heuristic for the flow shop scheduling problem , 2004, Comput. Oper. Res..

[11]  L. Darrell Whitley,et al.  Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance , 2002, INFORMS J. Comput..

[12]  Jatinder N. D. Gupta,et al.  Performance guarantees for flowshop heuristics to minimize makespan , 2006, Eur. J. Oper. Res..

[13]  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..

[14]  S.M.A. Suliman,et al.  A two-phase heuristic approach to the permutation flow-shop scheduling problem , 2000 .

[15]  Mohamed Haouari,et al.  A branch-and-bound-based local search method for the flow shop problem , 2003, J. Oper. Res. Soc..

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

[17]  Jerzy Kamburowski,et al.  Non-bottleneck machines in three-machine flow shops , 2000 .

[18]  V. Barnett,et al.  Applied Linear Statistical Models , 1975 .

[19]  Michael H. Kutner.  Applied Linear Statistical Models , 1974 .

[20]  J. Kamburowski,et al.  On the NEH heuristic for minimizing the makespan in permutation flow shops , 2007 .

[21]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

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

[23]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[24]  Ali Allahverdi,et al.  New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..

[25]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

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

[27]  Eugeniusz Nowicki,et al.  New Results in the Worst-Case Analysis for Flow-Shop Scheduling , 1993, Discret. Appl. Math..

[28]  David B. Shmoys,et al.  Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.

[29]  C. Rajendran,et al.  Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem , 2003 .

[30]  Rubén Ruiz,et al.  TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .

[31]  Jerzy Kamburowski,et al.  A heuristic for minimizing the makespan in no-idle permutation flow shops , 2005, Comput. Ind. Eng..

[32]  Imre Bárány,et al.  A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees , 1981, Math. Oper. Res..

[33]  Helena Ramalhinho Dias Lourenço,et al.  Sevast'yanov's algorithm for the flow-shop scheduling problem , 1996 .

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

[35]  Jung Woo Jung,et al.  Flowshop-scheduling problems with makespan criterion: a review , 2005 .

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

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

[38]  C. Dennis Pegden,et al.  A survey and evaluation of static flowshop scheduling heuristics , 1984 .

[39]  Yeong-Dae Kim,et al.  Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .

[40]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[41]  Anurag Agarwal,et al.  Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach , 2006, Eur. J. Oper. Res..

[42]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

[43]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[44]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[45]  J. Grabowski,et al.  The permutation flow shop problem with blocking. A tabu search approach , 2007 .

[46]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .