Elite guided steady-state genetic algorithm for minimizing total tardiness in flowshops

In this research, a detailed study of the permutation flowshop scheduling problem with the objective of minimizing total tardiness is presented and a steady-state genetic algorithm solution procedure is developed for such problems. Also, using problem-specific knowledge, a very efficient elite guided solution improvement scheme and an appropriate crossover operator have been developed and integrated into the proposed method. Using benchmark problems, the algorithm has been compared with heuristic algorithms having the best performance in the literature. The performance of the developed algorithm is shown to be superior using a simulation study.

[1]  Kenji Itoh,et al.  Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge , 1995 .

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

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

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

[5]  Mitsuo Gen,et al.  A steady-state genetic algorithm for multi-product supply chain network design , 2009, Comput. Ind. Eng..

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

[7]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

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

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

[10]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[11]  Shao‐Chi Chang,et al.  The effect of alliance experience and intellectual capital on the value creation of international strategic alliances , 2008 .

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

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

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

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

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

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

[18]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

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

[20]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

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

[23]  Chuen-Lung Chen,et al.  An application of genetic algorithms for flow shop problems , 1995 .

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

[25]  Christos Koulamas.  A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem , 1998, Comput. Oper. Res..

[26]  John M. Wilson,et al.  Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem , 2008, Appl. Math. Comput..

[27]  C. Rajendran,et al.  Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flowline-based manufacturing cell , 1998 .

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

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

[30]  Yeong-Dae Kim.  Minimizing total tardiness in permutation flowshops , 1995 .

[31]  Belarmino Adenso-Díaz,et al.  An SA/TS mixture algorithm for the scheduling tardiness problem , 1996 .

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

[33]  Eitan Zemel.  Measuring the Quality of Approximate Solutions to Zero-One Programming Problems , 1981, Math. Oper. Res..

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

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

[36]  B. Adenso-Díaz.  Restricted neighborhood in the tabu search for the flowshop problem , 1992 .

[37]  Xin Yao,et al.  Evolutionary Optimization , 2002 .