Heuristics for the mixed no-idle flowshop with sequence-dependent setup times and total flowtime criterion

Abstract This paper addresses the mixed no-idle flowshop scheduling problem with sequence-dependent setup times and total flowtime minimisation. In the mixed no-idle flowshop problem, machines that allow idleness coexist with stages that require uninterrupted processing. We studied an extension of this problem, which considers sequence-dependent setup times in machines where idleness is allowed. We present a mixed integer linear programming (MILP) model for the new problem. We also provide a method to evaluate the total flowtime of a permutation sequence. Furthermore, an acceleration method to calculate the total flowtime in an insertion neighbourhood is proposed. A new set of efficient heuristics were developed. In order to evaluate the proposed methods we adapted the best known heuristics available from related problems. The adapted heuristics, as well as the methods proposed here, were tested and compared through statistical and computational experimentation in an extensive benchmark with 4500 instances. We also compared the proposed heuristics with the optimal solutions found by the MILP formulation for small sized problems instances. The results demonstrate that the proposed heuristics perform extremely well in terms of solution quality and computational efficiency.

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

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

[3]  Marcelo Seido Nagano,et al.  Reducing mean flow time in permutation flow shop , 2008, J. Oper. Res. Soc..

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

[5]  Quan-Ke Pan,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[6]  Rubén Ruiz,et al.  Scheduling in Flowshops with No-Idle Machines , 2009 .

[7]  P. C. Bagga,et al.  Flowshop/No-idle Scheduling to Minimize Total Elapsed Time , 2005, J. Glob. Optim..

[8]  P. C. Bagga,et al.  Flowshop/no-idle scheduling to minimise the mean flowtime , 2005, The ANZIAM Journal.

[9]  Quan-Ke Pan,et al.  A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion , 2013 .

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

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

[12]  Ali Allahverdi,et al.  The significance of reducing setup times/setup costs , 2008, Eur. J. Oper. Res..

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

[14]  Gur Mosheiov,et al.  A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time , 2008, Eur. J. Oper. Res..

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

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

[17]  Victor Fernandez-Viagas,et al.  A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime , 2016, Expert Syst. Appl..

[18]  M. F. Tasgetiren,et al.  A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion , 2011 .

[19]  Ling Wang,et al.  No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm , 2008 .

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

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

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

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

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

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

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

[27]  Sergey Sevastyanov,et al.  The flow shop problem with no-idle constraints: A review and approximation , 2009, Eur. J. Oper. Res..

[28]  Mehmet Fatih Tasgetiren,et al.  A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem , 2013, Comput. Oper. Res..

[29]  Alain Guinet,et al.  Three stage no-idle flow-shops , 2003 .

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

[31]  Victor Fernandez-Viagas,et al.  A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation , 2017, Eur. J. Oper. Res..

[32]  Quan-Ke Pan,et al.  A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems , 2008 .

[33]  Ji-Bo Wang,et al.  Flow shop makespan minimization scheduling with deteriorating jobs under dominating machines , 2012 .

[34]  Shijie Sun,et al.  A note on flow shop scheduling problems with a learning effect on no-idle dominant machines , 2007, Appl. Math. Comput..

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

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

[37]  Marcelo Seido Nagano,et al.  An effective constructive heuristic for permutation flow shop scheduling problem with total flow time criterion , 2017 .

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

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

[40]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[41]  Jerzy Kamburowski,et al.  More on three-machine no-idle flow shops , 2004, Comput. Ind. Eng..

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

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

[44]  Milan Vlach,et al.  Note: On the two-machine no-idle flowshop problem , 2000 .

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

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

[47]  Marcelo Seido Nagano,et al.  Evaluation of high performance constructive heuristics for the flow shop with makespan minimization , 2016 .

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

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

[50]  Marcelo Seido Nagano,et al.  High-performing heuristics to minimize flowtime in no-idle permutation flowshop , 2019 .

[51]  Ji-Bo Wang,et al.  A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines , 2010, Eur. J. Oper. Res..

[52]  Jerzy Kamburowski,et al.  On no-wait and no-idle flow shops with makespan criterion , 2007, Eur. J. Oper. Res..

[53]  D. Pohoryles,et al.  Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .

[54]  Quan-Ke Pan,et al.  An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem , 2014 .

[55]  Yongquan Zhou,et al.  Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem , 2014, Neurocomputing.

[56]  Victor Fernandez-Viagas,et al.  A new set of high-performing heuristics to minimise flowtime in permutation flowshops , 2015, Comput. Oper. Res..

[57]  T. C. Edwin Cheng,et al.  Flowshop scheduling of deteriorating jobs on dominating machines , 2011, Comput. Ind. Eng..

[58]  Marcelo Seido Nagano,et al.  A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop , 2017, Prod. Eng..

[59]  Alain Guinet,et al.  A travelling salesman approach to solve the F , 2005, Eur. J. Oper. Res..

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

[61]  Shengyao Wang,et al.  A bi-population EDA for solving the no-idle permutation flow-shop scheduling problem with the total tardiness criterion , 2015, Knowl. Based Syst..

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

[63]  Ali Allahverdi,et al.  The third comprehensive survey on scheduling problems with setup times/costs , 2015, Eur. J. Oper. Res..

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

[65]  Jerzy Kamburowski,et al.  A heuristic for minimizing the makespan in no-idle permutation flow shops , 2005, Comput. Ind. Eng..

[66]  C. R. Woollam.  Flowshop with no idle machine time allowed , 1986 .

[67]  Xingsheng Gu,et al.  A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion , 2012, Comput. Oper. Res..

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

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

[70]  Victor Fernandez-Viagas,et al.  Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness , 2018, Expert Syst. Appl..

[71]  Teodor Gabriel Crainic,et al.  Parallel Strategies for Meta-Heuristics , 2003, Handbook of Metaheuristics.

[72]  Porpan Vachajitpan,et al.  Job sequencing with continuous machine operation , 1982 .