A Genetic Algorithm with Local Search for Solving Job Shop Problems

This paper presents a genetic algorithm specially designed for job shop problems. The algorithm has a simple coding scheme and new crossover and mutation operators. A simple local search scheme is incorporated in the algorithm leading to a combined genetic algorithm (CGA). It is evaluated in three famous Muth and Thompson problems (i.e. MT6×6, MT10×10, MT20×5). The simulation study shows that this algorithm possesses high efficiency and is able to find out the optimal solutions for the job shop problems.

[1]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[2]  Takeshi Yamada,et al.  A genetic algorithm with multi-step crossover for job-shop scheduling problems , 1995 .

[3]  Peng Shi,et al.  Hinfinitycontrol of interconnected nonlinear sampled-data systems with parametric uncertainty , 1997, Int. J. Syst. Sci..

[4]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

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

[6]  Guoyong Shi,et al.  A genetic algorithm applied to a classic job-shop scheduling problem , 1997, Int. J. Syst. Sci..

[7]  Kazuhiko Kawamura,et al.  Exploring Problem-Specific Recombination Operators for Job Shop Scheduling , 1991, ICGA.

[8]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[9]  L. Darrell Whitley,et al.  A Comparison of Genetic Sequencing Operators , 1991, ICGA.

[10]  Takeshi Yamada,et al.  Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.

[11]  Q. H. Wu,et al.  Stochastic optimization of control parameters in genetic algorithms , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[12]  S. Bagchi.  Exploring problem-specific recombination operator for job shop , 1991 .

[13]  Jeffrey R. Barker,et al.  Scheduling the General Job-Shop , 1985 .

[14]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..