An efficient iterated local search algorithm for the total tardiness blocking flow shop problem

This paper deals with the blocking flow shop problem and proposes an Iterated Local Search (ILS) procedure combined with a variable neighbourhood search (VNS) for the total tardiness minimisation. The proposed ILS makes use of a NEH-based procedure to generate the initial solution, and uses a local search to intensify the exploration that combines the insertion and swap neighbourhood and uses a perturbation mechanism consisting of three neighbourhood operators to diversify the search. The computational evaluation has shown the effectiveness of combining the insertion and swap neighbourhood during the search despite the insertion neighbourhood being more effective than the swap neighbourhood for this problem. Finally, the computation of this algorithm when evaluated against two other algorithms from the literature shows good performance.

[1]  Yazid Mati,et al.  Complexity of flowshop scheduling problems with a new blocking constraint , 2003, Eur. J. Oper. Res..

[2]  F. D. Croce,et al.  The two-machine total completion time flow shop problem , 1996 .

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

[4]  Federico Della Croce,et al.  Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem , 2012, Comput. Oper. Res..

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

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

[7]  Dirk Van Oudheusden,et al.  Iterated local search for the team orienteering problem with time windows , 2009, Comput. Oper. Res..

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

[9]  Lixin Tang,et al.  A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times , 2010, Comput. Oper. Res..

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

[11]  Débora P. Ronconi,et al.  Tabu search for total tardiness minimization in flowshop scheduling problems , 1999, Comput. Oper. Res..

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

[13]  Ping Chen,et al.  An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion , 2009, Comput. Oper. Res..

[14]  Liang Zhang,et al.  An effective hybrid genetic algorithm for flow shop scheduling with limited buffers , 2006, Comput. Oper. Res..

[15]  Wen-Chiung Lee,et al.  Heuristic algorithms for solving the maximum lateness scheduling problem with learning considerations , 2007, Comput. Ind. Eng..

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

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

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

[19]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

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

[21]  D. Davendra,et al.  Scheduling flow shops with blocking using a discrete self-organising migrating algorithm , 2013 .

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

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

[24]  Wieslaw Kubiak,et al.  Sequencing of parts and robot moves in a robotic cell , 1989 .

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

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

[27]  Thomas Stützle,et al.  Iterated local search for the quadratic assignment problem , 2006, Eur. J. Oper. Res..

[28]  Ping Chen,et al.  A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time , 2013, Comput. Oper. Res..

[29]  Débora P. Ronconi,et al.  Minimização do tempo total de atraso no problema de flowshop com buffer zero através de busca tabu , 2000 .