A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime

In this work we present a review and comparative evaluation of heuristics and metaheuristics for the well-known permutation flowshop problem with the makespan criterion. A number of reviews and evaluations have already been proposed. However, the evaluations do not include the latest heuristics available and there is still no comparison of metaheuristics. Furthermore, since no common benchmarks and computing platforms are used, the results cannot be generalised. We propose a comparison of 25 methods, ranging from the classical Johnson's algorithm or dispatching rules to the most recent metaheuristics, including tabu search, simulated annealing, genetic algorithms, iterated local search and hybrid techniques. For the evaluation we use the standard test of Taillard [Eur. J. Operation. Res. 64 (1993) 278] composed of 120 instances of different sizes. In the evaluations we use the experimental design approach to obtain valid conclusions on the effectiveness and efficiency of the different methods tested.

[1]  Kenji Itoh,et al.  Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge , 1995 .

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

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

[4]  C. Rajendran.  Heuristic algorithm for scheduling in a flowshop to minimize total flowtime , 1993 .

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

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

[7]  Jaideep Motwani,et al.  Flowshop scheduling/sequencing research: a statistical review of the literature, 1952-1994 , 1997 .

[8]  R. Ahmadi,et al.  Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop , 1990 .

[9]  C. Rajendran,et al.  An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs , 1997 .

[10]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[11]  E. S. Page.  An Approach to the Scheduling of Jobs on Machines , 1961 .

[12]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

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

[14]  D. Chaudhuri,et al.  An efficient heuristic approach to the scheduling of jobs in a flowshop , 1992 .

[15]  Richard A. Dudek,et al.  Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines , 1964 .

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

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

[18]  Colin R. Reeves,et al.  Improving the Efficiency of Tabu Search for Machine Sequencing Problems , 1993 .

[19]  Frank Werner,et al.  On the heuristic solution of the permutation flow shop problem by path algorithms , 1993, Comput. Oper. Res..

[20]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[21]  Xiaoping Li,et al.  Iterative Heuristics for Permutation Flow Shops with Total Flowtime Minimization , 2006, BASYS.

[22]  WUCheng,et al.  An Efficient Constructive Heuristic for Permutation Flow Shops to Minimize Total Flowtime , 2005 .

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

[24]  Jose M. Framiñan,et al.  Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003 , 2004 .

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

[26]  Ali Allahverdi,et al.  New heuristics to minimize total completion time in m-machine flowshops , 2002 .

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

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

[29]  Said Ashour.  Letter to the Editor - An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling Techniques , 1970, Oper. Res..

[30]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

[31]  Dk Smith,et al.  Simulated annealing for the permutation flowshop problem , 1991 .

[32]  Jiyin Liu,et al.  Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..

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

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

[35]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[36]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[37]  P. Aravindan,et al.  Constructive and improvement flow shop scheduling heuristics: An extensive evaluation , 2001 .

[38]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[39]  Maurice Bonney,et al.  Solutions to the Constrained Flowshop Sequencing Problem , 1976 .

[40]  Subhash C. Sarin,et al.  Scheduling heuristic for the n-jobm-machine flow shop , 1993 .

[41]  Jose M. Framiñan,et al.  Production , Manufacturing and Logistics Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation , 2002 .

[42]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .

[43]  Mohamed Ben-Daya,et al.  A tabu search approach for the flow shop scheduling problem , 1998, Eur. J. Oper. Res..

[44]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

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

[46]  Jean-Marie Proth,et al.  Heuristic approaches for n/m/F/ ∑Ci scheduling problems , 1997 .

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

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

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

[50]  李小平,et al.  A Fast Method for Heuristics in Large-Scale Flow Shop Scheduling , 2006 .

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

[52]  Sihgeji Miyazaki,et al.  AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM. , 1978 .

[53]  Hoon-Shik Woo,et al.  A heuristic algorithm for mean flowtime objective in flowshop scheduling , 1998, Comput. Oper. Res..

[54]  Chuen-Lung Chen,et al.  An application of genetic algorithms for flow shop problems , 1995 .

[55]  Jatinder N. D. Gupta,et al.  Heuristic Algorithms for Multistage Flowshop Scheduling Problem , 1972 .

[56]  Joel P. Stinson,et al.  A heuristic proǵramminǵ procedure for sequencinǵ the static flowshop , 1982 .

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

[58]  Ling Wang,et al.  An Effective Hybrid Heuristic for Flow Shop Scheduling , 2003 .

[59]  D. Chaudhuri,et al.  A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME , 1991 .

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

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

[62]  Hamid Davoud Pour.  A new heuristic for the n-job, m-machine flow-shop problem , 2001 .

[63]  Lixin Tang,et al.  A modified genetic algorithm for the flow shop sequencing problem to minimize mean flow time , 2002, J. Intell. Manuf..

[64]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[65]  Shigeji Miyazaki,et al.  ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING , 1980 .

[66]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[67]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[68]  Chandrasekharan Rajendran,et al.  A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs , 2005, Eur. J. Oper. Res..

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

[70]  Kenneth Steiglitz,et al.  Heuristic-Programming Solution of a Flowshop-Scheduling Problem , 1974, Oper. Res..

[71]  Maristela Oliveira dos Santos,et al.  An adaptive hybrid metaheuristic for permutation flowshop scheduling , 2000 .

[72]  Wojciech Bozejko,et al.  Solving the Flow Shop Problem by Parallel Simulated Annealing , 2001, PPAM.

[73]  S. S. Panwalkar,et al.  The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..

[74]  Johnny C. Ho,et al.  Flowshop sequencing with mean flowtime objective , 1995 .

[75]  Yih-Long Chang,et al.  A new heuristic for the n-job, M-machine flow-shop problem , 1991 .

[76]  João Vitor Moccellin,et al.  A New Heuristic Method for the Permutation Flow Shop Scheduling Problem , 1995 .

[77]  Hideo Tanaka,et al.  Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .

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

[79]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2007, GECCO '07.