Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion

Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling problem (BFSP) with the makespan criterion. Main contributions of this paper can be summed up as follows. We propose a constructive heuristic to generate an initial solution. The constructive heuristic generates better results than those currently in the literature. We employ and adopt well-known speed-up methods from the literature for both insertion and swap neighborhood structures. In addition, an iteration jumping probability is proposed to change the neighborhood structure from insertion neighborhood to swap neighborhood. Generally speaking, the insertion neighborhood is much more effective than the swap neighborhood for the permutation flowshop scheduling problems. Instead of considering the use of these neighborhood structures in a framework of the variable neighborhood search algorithm, two powerful local search algorithms are designed in such a way that the search process is guided by an iteration jumping probability determining which neighborhood structure will be employed. By doing so, it is shown that some additional enhancements can be achieved by employing the swap neighborhood structure with a speed-up method without jeopardizing the effectiveness of the insertion neighborhood. We also show that the performance of the iterated greedy algorithm significantly depends on the speed-up method employed. The parameters of the proposed iterated greedy algorithms are tuned through a design of experiments on randomly generated benchmark instances. Extensive computational results on Taillard's well-known benchmark suite show that the iterated greedy algorithms with speed-up methods are equivalent or superior to the best performing algorithms from the literature. Ultimately, 85 out of 120 problem instances are further improved with substantial margins. A new constructive heuristic is proposed.Speed-up methods from the literature are adapted very well.IG algorithm is superior with the speed-up method. But without a speed-up method, its performance is poor.We propose an iteration jumping probability to employ the swap neighborhood structure.Ultimately, 85 out of 90 problem instances are further improved.

[1]  Józef Grabowski,et al.  Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..

[2]  Ling Wang,et al.  Solving the blocking flow shop scheduling problem by a dynamic multi-swarm particle swarm optimizer , 2011 .

[3]  Eugeniusz Nowicki,et al.  The permutation flow shop with buffers: A tabu search approach , 1999, Eur. J. Oper. Res..

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

[5]  Jacek Blazewicz,et al.  Handbook on Scheduling: From Theory to Applications , 2014 .

[6]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2008, Comput. Ind. Eng..

[7]  Mehmet Fatih Tasgetiren,et al.  A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem , 2011, Comput. Ind. Eng..

[8]  Débora P. Ronconi,et al.  Some heuristic algorithms for total tardiness minimization in a flowshop with blocking , 2009 .

[9]  Xavier Tort-Martorell,et al.  An efficient Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with total flowtime minimization , 2015, Expert Syst. Appl..

[10]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers , 2009 .

[11]  J. Grabowski,et al.  The permutation flow shop problem with blocking. A tabu search approach , 2007 .

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

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

[14]  Ling Wang,et al.  An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers , 2008, Comput. Oper. Res..

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

[16]  Ponnuthurai N. Suganthan,et al.  A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems , 2010, Comput. Oper. Res..

[17]  José Humberto Ablanedo-Rosas,et al.  Makespan and workstation utilization minimization in a flowshop with operations flexibility , 2011 .

[18]  Quan-Ke Pan,et al.  Local search methods for the flowshop scheduling problem with flowtime minimization , 2012, Eur. J. Oper. Res..

[19]  Shih-Wei Lin,et al.  Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm , 2013 .

[20]  Imma Ribas,et al.  An iterated greedy algorithm for the flowshop scheduling problem with blocking , 2011 .

[21]  Czesław Smutnicki,et al.  A two-machine permutation flow shop scheduling problem with buffers , 1998 .

[22]  Débora P. Ronconi,et al.  Lower bounding schemes for flowshops with blocking in-process , 2001, J. Oper. Res. Soc..

[23]  Saul I. Gass,et al.  Erratum to "Cycling in linear programming problems" [Computers and Operations Research 31 (2002) 303-311] , 2006, Comput. Oper. Res..

[24]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

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

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

[27]  Cheng Wang,et al.  A three-phase algorithm for flowshop scheduling with blocking to minimize makespan , 2012, Comput. Oper. Res..

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

[29]  Chelliah Sriskandarajah,et al.  Minimizing Cycle Time in a Blocking Flowshop , 2000, Oper. Res..

[30]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops , 2011, Inf. Sci..

[31]  Michael Pinedo,et al.  Sequencing in an Assembly Line with Blocking to Minimize Cycle Time , 1989, Oper. Res..

[32]  Tapan P. Bagchi,et al.  Minimizing makespan in a blocking flowshop using genetic algorithms , 2001 .

[33]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for single machine total weighted tardiness problem with sequence dependent setup times , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

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

[35]  Mehmet Fatih Tasgetiren,et al.  Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms , 2010, Expert Syst. Appl..

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

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

[38]  Ling Wang,et al.  Effective heuristics for the blocking flowshop scheduling problem with makespan minimization , 2012 .

[39]  E. Lawler,et al.  Well-solved special cases , 1985 .

[40]  Rubén Ruiz,et al.  Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem , 2010 .

[41]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers , 2009, Comput. Oper. Res..

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

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

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

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

[46]  Min Liu,et al.  A High Performing Memetic Algorithm for the Flowshop Scheduling Problem With Blocking , 2013, IEEE Transactions on Automation Science and Engineering.

[47]  Imma Ribas,et al.  A competitive variable neighbourhood search algorithm for the blocking flow shop problem , 2013 .

[48]  Débora P. Ronconi,et al.  A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking , 2005, Ann. Oper. Res..

[49]  Débora P. Ronconi,et al.  A note on constructive heuristics for the flowshop problem with blocking , 2004 .

[50]  Rainer Leisten,et al.  Flowshop sequencing problems with limited buffer storage , 1990 .