Evaluation of high performance constructive heuristics for the flow shop with makespan minimization

This paper analyzes the permutation flow shop scheduling problem with makespan minimization criteria. Since the publication of the well-known NEH heuristic from Nawaz, Enscore and Ham in 1983, several constructive heuristic methods have been developed. In this paper, we proposed constructive methods that make use of the principles of the NEH heuristic and recent studies to significantly improve its performance. For this purpose, 67 new constructive heuristic methods were proposed in this paper. Through a literature review, the main constructive methods for makespan minimization were identified. An extensive computational experiment was conducted with the best heuristics proposed in this paper and those identified in the literature for comparison and evaluation purposes. Based on the results, some of the proposed methods significantly outperform the literature heuristics, providing high quality solutions.

[1]  Jerzy Kamburowski,et al.  On Recent Modifications And Extensions Of The Neh Heuristic For Flow Shop Sequencing , 2011 .

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

[3]  Rubén Ruiz,et al.  New high performing heuristics for minimizing makespan in permutation flowshops , 2009 .

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

[5]  Victor Fernandez-Viagas,et al.  On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem , 2014, Comput. Oper. Res..

[6]  Jerzy Kamburowski,et al.  An empirical analysis of the optimality rate of flow shop heuristics , 2009, Eur. J. Oper. Res..

[7]  Jatinder N. D. Gupta,et al.  A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .

[8]  Jose M. Framiñan,et al.  New hard benchmark for flowshop scheduling problems minimising makespan , 2015, Eur. J. Oper. Res..

[9]  Wang Yue-xuan,et al.  Heuristic algorithms for large flowshop scheduling problems , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

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

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

[12]  Jayant Rajgopal,et al.  An extension of Palmer's heuristic for the flow shop scheduling problem , 1988 .

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

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

[15]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

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

[17]  Lee J. Krajewski,et al.  Kanban, MRP, and Shaping the Manufacturing Environment , 1987 .

[18]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[19]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

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

[21]  Ping Chen,et al.  An improved NEH-based heuristic for the permutation flowshop problem , 2008, Comput. Oper. Res..

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

[23]  Chinyao Low,et al.  A robust simulated annealing heuristic for flow shop scheduling problems , 2004 .

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

[25]  Christos Koulamas,et al.  A new constructive heuristic for the flowshop scheduling problem , 1998, Eur. J. Oper. Res..

[26]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..

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

[28]  Jiyin Liu,et al.  Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling , 1993 .

[29]  Jerzy Kamburowski,et al.  An improved NEH heuristic to minimize makespan in permutation flow shops , 2008, Comput. Oper. Res..

[30]  Xavier Tort-Martorell,et al.  Comparing three-step heuristics for the permutation flow shop problem , 2010, Comput. Oper. Res..