Review and classification of constructive heuristics mechanisms for no-wait flow shop problem

Permutation flow shop scheduling has been studied since the 1950s. Due to practical applications and because of its complex nature, several constrains have been studied, for example the no-wait flow shop problem. Classified as non-deterministic polynomial-time hard (NP-hard), several constructive heuristics have been proposed to reach the best trade-off between quality of the solution and computational time. This paper aims to present a review and classification of constructive heuristics proposed for no-wait flow shop problem with additional constraints (setup times, machine unavailability, release dates, and due dates) and several criterion objectives (makespan, total flow time, due date consideration, and multi-criterion objectives). As a result of the literature review, constructive heuristics were classified according to its composition (initial sequence generation, constructive phase, and improvement phase) and category (simple or composite). Several different mechanisms from the considered phases could be identified. These mechanisms can be combined to develop new constructive heuristics and can be applied for other scheduling problems. Besides, final considerations highlight directions for future possible researches, mainly the development of new strategies, for each phase considered.

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

[2]  Chelliah Sriskandarajah,et al.  Some no-wait shops scheduling problems: Complexity aspect , 1986 .

[3]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[4]  Xiaoping Li,et al.  Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion , 2010, Eur. J. Oper. Res..

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

[6]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[7]  Ronald G. McGarvey,et al.  Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated , 2004, J. Oper. Res. Soc..

[8]  Hans Röck,et al.  The Three-Machine No-Wait Flow Shop is NP-Complete , 1984, JACM.

[9]  Chuen-Lung Chen,et al.  Genetic algorithms applied to the continuous flow shop problem , 1996 .

[10]  Yves Robert,et al.  Introduction to Scheduling , 2009, CRC computational science series.

[11]  Vitaly A. Strusevich,et al.  Two-machine flow shop no-wait scheduling with machine maintenance , 2005, 4OR.

[12]  Xiaoping Li,et al.  Heuristic for no-wait flow shops with makespan minimization , 2008, ICIT 2008.

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

[14]  C. V. Ramamoorthy,et al.  On the Flow-Shop Sequencing Problem with No Wait in Process † , 1972 .

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

[16]  J. Framiñan,et al.  An efficient heuristic for total flowtime minimisation in no-wait flowshops , 2010 .

[17]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[18]  Rubén Ruiz,et al.  No-wait flowshop with separate setup times to minimize maximum lateness , 2007 .

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

[20]  D. Chaudhuri,et al.  Heuristic algorithms for continuous flow-shop problem , 1990 .

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

[22]  T. C. Edwin Cheng,et al.  Heuristics for two-machine no-wait flowshop scheduling with an availability constraint , 2001, Inf. Process. Lett..

[23]  Sartaj Sahni,et al.  Complexity of Scheduling Shops with No Wait in Process , 1979, Math. Oper. Res..

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

[25]  Christos H. Papadimitriou,et al.  Flowshop scheduling with limited temporary storage , 1980, JACM.

[26]  Dipak Laha,et al.  An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop , 2014, Comput. Ind. Eng..

[27]  Tariq Aldowaisan,et al.  No-wait flowshops with bicriteria of makespan and total completion time , 2002, J. Oper. Res. Soc..

[28]  Tariq A. Aldowaisan,et al.  No-wait and separate setup three-machine flowshop with total completion time criterion , 2000 .

[29]  Chris N. Potts,et al.  Two-Machine No-Wait Flow Shop Scheduling with Missing Operations , 1999, Math. Oper. Res..

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

[31]  D. A. Wismer,et al.  Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..

[32]  Cheng Wu,et al.  Some heuristics for no-wait flowshops with total tardiness criterion , 2013, Comput. Oper. Res..

[33]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion , 2011 .

[34]  Jatinder N. D. Gupta,et al.  A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops , 2014, J. Oper. Res. Soc..

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

[36]  Stefan Voß,et al.  Solving the continuous flow-shop scheduling problem by metaheuristics , 2003, Eur. J. Oper. Res..

[37]  Tariq A. Aldowaisan,et al.  NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME , 2004 .

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

[39]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[40]  Z. Xia,et al.  No-wait or no-idle permutation flowshop scheduling with dominating machines , 2005 .

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

[42]  Dipak Laha,et al.  A heuristic for no-wait flow shop scheduling , 2013 .

[43]  M. F. Tasgetiren,et al.  A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .

[44]  Chandrasekharan Rajendran,et al.  A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .

[45]  Tariq A. Aldowaisan.  A new heuristic and dominance relations for no-wait flowshops with setups , 2001, Comput. Oper. Res..

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

[47]  T. C. Edwin Cheng,et al.  Approximability of two-machine no-wait flowshop scheduling with availability constraints , 2003, Oper. Res. Lett..

[48]  Ali Allahverdi,et al.  No-wait flowshop scheduling problem to minimize the number of tardy jobs , 2012 .

[49]  Krzysztof Giaro.  NP-hardness of compact scheduling in simplified open and flow shops , 2001, Eur. J. Oper. Res..

[50]  C. Rajendran,et al.  Heuristic algorithms for scheduling in the no-wait flowshop , 1993 .

[51]  Edy Bertolissi,et al.  Heuristic algorithm for scheduling in the no-wait flow-shop , 2000 .

[52]  Cheng Wu,et al.  Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments , 2008, Science in China Series F: Information Sciences.

[53]  Lucio Bianco,et al.  Flow Shop No-Wait Scheduling With Sequence Dependent Setup Times And Release Dates , 1999 .

[54]  Marcelo Seido Nagano,et al.  A constructive heuristic for total flowtime minimization in a no-wait flowshop with sequence-dependent setup times , 2015 .

[55]  Saied Darwish,et al.  A knowledge-base for electronics soldering , 2000 .

[56]  Ali Allahverdi,et al.  Total flowtime in no-wait flowshops with separated setup times , 1998, Comput. Oper. Res..

[57]  Marcelo Seido Nagano,et al.  New heuristics for the no-wait flowshop with sequence-dependent setup times problem , 2015 .

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

[59]  Rubén Ruiz,et al.  Some effective heuristics for no-wait flowshops with setup times to minimize total completion time , 2007, Ann. Oper. Res..

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

[61]  Quan-Ke Pan,et al.  Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization , 2013 .

[62]  Ali Allahverdi,et al.  Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times , 2001, J. Oper. Res. Soc..

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

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

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

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

[67]  René van Dal,et al.  Solvable Cases of the No-Wait Flow-Shop Scheduling Problem , 1991 .

[68]  Stefan Voß,et al.  Meta-heuristics: The State of the Art , 2000, Local Search for Planning and Scheduling.

[69]  S. S. Panwalkar,et al.  Ordered Flow Shop Problems with no In-Process Waiting: Further Results , 1980 .

[70]  T. C. Edwin Cheng,et al.  3/2-approximation for Two-machine No-wait Flowshop Scheduling with Availability Constraints , 2003, Inf. Process. Lett..

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

[72]  Uday K. Chakraborty,et al.  A constructive heuristic for minimizing makespan in no-wait flow shop scheduling , 2009 .

[73]  Marcelo Seido Nagano,et al.  Evaluating the performance for makespan minimisation in no-wait flowshop sequencing , 2008 .

[74]  Marie-Laure Espinouse,et al.  Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability , 1999 .

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

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

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