Hybrid evolutionary algorithm with marriage of genetic algorithm and extremal optimization for production scheduling

This paper presents a hybrid evolutionary algorithm with marriage of genetic algorithm (GA) and extremal optimization (EO) for solving a class of production scheduling problems in manufacturing. The scheduling problem, which is derived from hot rolling production in steel industry, is characterized by two major requirements: (i) selecting a subset of orders from manufacturing orders to be processed; (ii) determining the optimal production sequence under multiple constraints, such as sequence-dependant transition costs, non-execution penalties, earliness/tardiness (E/T) penalties, etc. A combinatorial optimization model is proposed to formulate it mathematically. For its NP-hard complexity, an effective hybrid evolutionary algorithm is developed to solve the scheduling problem through combining the population-based search capacity of GA and the fine-grained local search efficacy of EO. The experimental results with production scale data demonstrate that the proposed hybrid evolutionary algorithm can provide superior performances in scheduling quality and computation efficiency.

[1]  Lixin Tang,et al.  Iterated local search algorithm based on very large-scale neighborhood for prize-collecting vehicle routing problem , 2006 .

[2]  Chang Wook Ahn,et al.  A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..

[3]  Rubén Ruiz,et al.  Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics , 2005, Eur. J. Oper. Res..

[4]  E. Balas,et al.  New classes of efficiently solvable generalized Traveling Salesman Problems , 1999, Ann. Oper. Res..

[5]  Stefan Boettcher,et al.  Optimization with extremal dynamics , 2003, Complex..

[6]  Michel Gendreau,et al.  The hot strip mill production scheduling problem: A tabu search approach , 1998, Eur. J. Oper. Res..

[7]  Refael Hassin,et al.  Machine scheduling with earliness, tardiness and non-execution penalties , 2005, Comput. Oper. Res..

[8]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[9]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[10]  Fabiano Luis de Sousa,et al.  Generalized extremal optimization: An application in heat pipe design , 2004 .

[11]  Paul A. Rubin,et al.  Scheduling in a sequence dependent setup environment with genetic search , 1995, Comput. Oper. Res..

[12]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[13]  N. Anantharaman,et al.  Generating non-permutation schedules in flowline-based manufacturing sytems with sequence-dependent setup times of jobs: a heuristic approach , 2004 .

[14]  Sung-Shick Kim,et al.  A Tabu Search Algorithm for Single Machine Scheduling with Release Times, Due Dates, and Sequence-Dependent Set-up Times , 2002 .

[15]  Shi-Chung Chang,et al.  Scheduling flexible flow shops with sequence-dependent setup effects , 2000, IEEE Trans. Robotics Autom..

[16]  Stefan Boettcher,et al.  Extremal Optimization: Methods derived from Co-Evolution , 1999, GECCO.

[17]  Peter Cowling,et al.  A flexible decision support system for steel hot rolling mill scheduling , 2003, Comput. Ind. Eng..

[18]  Thomas A. Feo,et al.  A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties , 1996, Comput. Oper. Res..

[19]  A. Percus,et al.  Nature's Way of Optimizing , 1999, Artif. Intell..