An Iterated Greedy Heuristic for Mixed No-Wait Flowshop Problems

The mixed no-wait flowshop problem with both wait and no-wait constraints has many potential real-life applications. The problem can be regarded as a generalization of the traditional permutation flowshop and the no-wait flowshop. In this paper, we study, for the first time, this scheduling setting with makespan minimization. We first propose a mathematical model and then we design a speed-up makespan calculation procedure. By introducing a varying number of destructed jobs, a modified iterated greedy algorithm is proposed for the considered problem which consists of four components: 1) initialization solution construction; 2) destruction; 3) reconstruction; and 4) local search. To further improve the intensification and efficiency of the proposal, insertion is performed on some neighbor jobs of the best position in a sequence during the initialization, solution construction, and reconstruction phases. After calibrating parameters and components, the proposal is compared with five existing algorithms for similar problems on adapted Taillard benchmark instances. Experimental results show that the proposal always obtains the best performance among the compared methods.

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

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

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

[4]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[5]  Quan-Ke Pan,et al.  An Improved Artificial Bee Colony Algorithm for Solving Hybrid Flexible Flowshop With Dynamic Operation Skipping , 2016, IEEE Transactions on Cybernetics.

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

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

[8]  Shih-Wei Lin,et al.  Bi-objective reentrant hybrid flowshop scheduling: an iterated Pareto greedy algorithm , 2014 .

[9]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

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

[11]  Shiji Song,et al.  Accelerated methods for total tardiness minimisation in no-wait flowshops , 2015 .

[12]  Thomas Bartz-Beielstein,et al.  Experimental Methods for the Analysis of Optimization Algorithms , 2010 .

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

[14]  Shih-Wei Lin,et al.  Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm , 2013 .

[15]  Ranga V. Ramasesh.  Dynamic job shop scheduling: A survey of simulation research , 1990 .

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

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

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

[19]  MengChu Zhou,et al.  TTSA: An Effective Scheduling Approach for Delay Bounded Tasks in Hybrid Clouds , 2017, IEEE Transactions on Cybernetics.

[20]  Lin-Yu Tseng,et al.  A hybrid genetic algorithm for no-wait flowshop scheduling problem , 2010 .

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

[22]  Quan-Ke Pan,et al.  An estimation of distribution algorithm for lot-streaming flow shop problems with setup times , 2012 .

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

[24]  Bassem Jarboui,et al.  A hybrid genetic algorithm for solving no-wait flowshop scheduling problems , 2011 .

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

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

[27]  Liang Gao,et al.  An efficient memetic algorithm for solving the job shop scheduling problem , 2011, Comput. Ind. Eng..

[28]  Pierre Hansen,et al.  Variable neighborhood search , 1997, Eur. J. Oper. Res..

[29]  Quan-Ke Pan,et al.  An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling , 2016, Eur. J. Oper. Res..

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

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

[32]  Sara Hatami,et al.  Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times , 2015 .

[33]  Shih-Wei Lin,et al.  Multi-objective unrelated parallel machine scheduling: a Tabu-enhanced iterated Pareto greedy algorithm , 2016 .

[34]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

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

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

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

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

[39]  Abdelhakim AitZai,et al.  Branch-and-bound and PSO algorithms for no-wait job shop scheduling , 2016, J. Intell. Manuf..

[40]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[41]  Raymond Chiong,et al.  An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem , 2015, Appl. Soft Comput..

[42]  Quan-Ke Pan,et al.  An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .

[43]  Mark Johnston,et al.  Automatic Programming via Iterated Local Search for Dynamic Job Shop Scheduling , 2015, IEEE Transactions on Cybernetics.

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

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

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

[47]  Rubén Ruiz,et al.  Cooperative metaheuristics for the permutation flowshop scheduling problem , 2009, Eur. J. Oper. Res..

[48]  Quan-Ke Pan,et al.  A Hybrid Fruit Fly Optimization Algorithm for the Realistic Hybrid Flowshop Rescheduling Problem in Steelmaking Systems , 2016, IEEE Transactions on Automation Science and Engineering.