A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops

A novel temperature calculation formula for total tardiness minimization objective.A local search that is a random search with insertion and swap neighborhoods.Adaption of speedup method for total flow time objective to total tardiness.343 new best permutations out of 540 instances of the problem set has been found. The permutation flowshop scheduling problem is an NP-hard problem that has practical applications in production facilities and in other areas. An iterated greedy algorithm for solving the permutation flowshop scheduling problem with the objective of minimizing total tardiness is presented in this paper. The proposed iterated greedy algorithm uses a new formula for temperature calculation for acceptance criterion and the algorithm is hybridized with a random search algorithm to further enhance the solution quality. The performance of the proposed method is tested on a set of benchmark problems from the literature and is compared to three versions of the traditional iterated greedy algorithm using the same problem instances. Experimental results show that, the proposed algorithm is superior in performance to the other three iterated greedy algorithm variants. Ultimately, new best known solutions are obtained for 343 out of 540 problem instances.

[1]  Rym M'Hallah,et al.  An iterated local search variable neighborhood descent hybrid heuristic for the total earliness tardiness permutation flow shop , 2014 .

[2]  L. Gelders,et al.  Four simple heuristics for scheduling a flow-shop , 1978 .

[3]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[4]  Kenneth R. Baker,et al.  Computational results for the flowshop tardiness problem , 2013, Comput. Ind. Eng..

[5]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[6]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[7]  N. Schenker,et al.  On Judging the Significance of Differences by Examining the Overlap Between Confidence Intervals , 2001 .

[8]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[9]  Godfrey C. Onwubolu,et al.  Genetic algorithm for minimizing tardiness in flow-shop scheduling , 1999 .

[10]  N. Baba.  Convergence of a random optimization method for constrained optimization problems , 1981 .

[11]  Victor Fernandez-Viagas,et al.  NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness , 2015, Comput. Oper. Res..

[12]  Yeong-Dae Kim,et al.  Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .

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

[14]  Jeffrey E. Schaller,et al.  Note on minimizing total tardiness in a two-machine flowshop , 2005, Comput. Oper. Res..

[15]  Rainer Leisten,et al.  Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm , 2008 .

[16]  Jen-Shiang Chen,et al.  Minimizing tardiness in a two-machine flow-shop , 2002, Comput. Oper. Res..

[17]  Rubén Ruiz,et al.  Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics , 2008, Comput. Oper. Res..

[18]  Narayan Raman,et al.  Minimum tardiness scheduling in flow shops: Construction and evaluation of alternative solution approaches , 1995 .

[19]  Roberto Tadei,et al.  A new decomposition approach for the single machine total tardiness scheduling problem , 1998, J. Oper. Res. Soc..

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

[21]  John M. Wilson,et al.  Elite guided steady-state genetic algorithm for minimizing total tardiness in flowshops , 2010, Comput. Ind. Eng..

[22]  Roger J.-B. Wets,et al.  Minimization by Random Search Techniques , 1981, Math. Oper. Res..

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

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

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

[26]  Jason Chao-Hsien Pan,et al.  Two-machine flowshop scheduling to minimize total tardiness , 1997, Int. J. Syst. Sci..

[27]  Yeong-Dae Kim,et al.  A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops , 1993, Comput. Oper. Res..

[28]  Yeong-Dae Kim,et al.  Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process , 1996 .

[29]  Tunchan Cura.  An evolutionary algorithm for the permutation flowshop scheduling problem with total tardiness criterion , 2015 .

[30]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[31]  Jatinder N. D. Gupta,et al.  The two-machine flowshop scheduling problem with total tardiness , 1989, Comput. Oper. Res..

[32]  Ömer Kirca,et al.  A branch and bound algorithm to minimize the total tardiness for m , 2006, Eur. J. Oper. Res..

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

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

[35]  Peng Si Ow,et al.  Focused Scheduling in Proportionate Flowshops , 1985 .

[36]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

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

[38]  Chandrasekharan Rajendran,et al.  Scheduling in flowshops to minimize total tardiness of jobs , 2004 .

[39]  Xiaoping Li,et al.  Integrated Iterated Local Search for the Permutation Flowshop Problem with Tardiness Minimization , 2013, 2013 IEEE International Conference on Systems, Man, and Cybernetics.

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