Minimizing makespan for no-wait flowshop scheduling problems with setup times

Abstract This study investigates no-wait flowshop scheduling problems with sequence-independent and sequence-dependent setup times aimed at minimizing the makespan. We propose an efficient two-phase matheuristic, which can optimally solve all tested instances of three existing benchmark problem sets and a new generated large-sized test problem set, with up to 20-machine and 2000-job test instances, in acceptable computational times. This is a dramatic improvement over all previously known algorithms. In view of the strongly NP-complete nature of the two problems addressed herein, this study contributes an exact method that can find optimal solutions for solving these problems with the efficiency necessary to meet real-world scheduling requirements.

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

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

[3]  Marcelo Seido Nagano,et al.  A High Quality Solution Constructive Heuristic for No-Wait Flow Shop Scheduling Problem , 2016 .

[4]  Ali Allahverdi,et al.  A survey of scheduling problems with no-wait in process , 2016, Eur. J. Oper. Res..

[5]  Thomas Stützle,et al.  An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives , 2008, Eur. J. Oper. Res..

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

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

[8]  Tarek Y. ElMekkawy,et al.  A genetic algorithm and particle swarm optimization for no-wait flow shop problem with separable setup times and makespan criterion , 2012 .

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

[10]  Jacques Carlier,et al.  Ordonnancements à contraintes disjonctives , 1978 .

[11]  Tarek Y. ElMekkawy,et al.  Solving the no-wait flow-shop problem with sequence-dependent set-up times , 2014, Int. J. Comput. Integr. Manuf..

[12]  Bertrand M. T. Lin,et al.  Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time , 2004, Comput. Ind. Eng..

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

[14]  Luciana S. Buriol,et al.  Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions , 2006 .

[15]  Keld Helsgaun,et al.  General k-opt submoves for the Lin–Kernighan TSP heuristic , 2009, Math. Program. Comput..

[16]  Marcelo Seido Nagano,et al.  Review and classification of constructive heuristics mechanisms for no-wait flow shop problem , 2016 .

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

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

[19]  Marcelo Seido Nagano,et al.  A new evolutionary clustering search for a no-wait flow shop problem with set-up times , 2012, Eng. Appl. Artif. Intell..

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

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

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

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

[24]  Marcelo Seido Nagano,et al.  An evolutionary clustering search for the no-wait flow shop problem with sequence dependent setup times , 2014, Expert Syst. Appl..

[25]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[26]  Fan T. Tseng,et al.  Two models for a family of flowshop sequencing problems , 2002, Eur. J. Oper. Res..

[27]  M. Jabbari,et al.  M-machine, no-wait flowshop scheduling with sequence dependent setup times and truncated learning function to minimize the makespan , 2016 .

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

[29]  Marcelo Seido Nagano,et al.  A new effective heuristic method for the no-wait flowshop with sequence-dependent setup times problem , 2011 .

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