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

In recent years, a large number of heuristics have been proposed for the minimization of the total or mean flowtime/completion time of the well-known permutation flowshop scheduling problem. Although some literature reviews and comparisons have been made, they do not include the latest available heuristics and results are hard to compare as no common benchmarks and computing platforms have been employed. Furthermore, existing partial comparisons lack the application of powerful statistical tools. The result is that it is not clear which heuristics, especially among the recent ones, are the best. This paper presents a comprehensive review and computational evaluation as well as a statistical assessment of 22 existing heuristics. From the knowledge obtained after such a detailed comparison, five new heuristics are presented. Careful designs of experiments and analyses of variance (ANOVA) techniques are applied to guarantee sound conclusions. The comparison results identify the best existing methods and show that the five newly presented heuristics are competitive or better than the best performing ones in the literature for the permutation flowshop problem with the total completion time criterion.

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

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

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

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

[5]  Xiaoping Li,et al.  Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization , 2009, Eur. J. Oper. Res..

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

[7]  Bassem Jarboui,et al.  An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems , 2009, Comput. Oper. Res..

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

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

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

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

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

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

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

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

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

[17]  Xiaoping Li,et al.  A Fast Method for Heuristics in Large-Scale Flow Shop Scheduling * , 2006 .

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

[19]  Q. Wang,et al.  Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .

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

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

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

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

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

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

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

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

[28]  Subhash C. Sarin,et al.  A heuristic to minimize total flow time in permutation flow shop , 2009 .

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

[30]  Ping Chen,et al.  An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion , 2009, Comput. Oper. Res..

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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