A steady-state evolutionary algorithm for the job shop problem

This paper describes an evolutionary search scheduling algorithm (ESSA) for the job shop scheduling problem (JSSP). If no specific knowledge of the problem is included in the EA then it is less likely that an EA will find the global optimum of a JSSP. However, the proposed steady state ESSA can find global optima if a particular population and offspring size is utilized. Adding specific knowledge through a Lamarckian Learning process improves the performance significantly. In this case, a good balance of the amount of Lamarckian Learning can realize a good performance in both efficiency and effectiveness.

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

[2]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

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

[4]  P. Chang,et al.  The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem , 2002 .

[5]  Takeshi Yamada,et al.  Scheduling by Genetic Local Search with Multi-Step Crossover , 1996, PPSN.

[6]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[7]  Harold H. Greenberg,et al.  A Branch-Bound Solution to the General Scheduling Problem , 1968, Oper. Res..

[8]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[9]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[10]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

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

[12]  Hisao Ishibuchi,et al.  Local search procedures in a multi-objective genetic local search algorithm for scheduling problems , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[13]  M. Rijckaert,et al.  A hybrid evolutionary search scheduling algorithm to solve the job shop scheduling problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[14]  Michael Pinedo,et al.  A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops , 1998 .

[15]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[16]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[17]  Rémy Dupas,et al.  Evaluation of mutation heuristics for solving a multiobjective flexible job shop by an evolutionary algorithm , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[18]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[19]  J. Lenstra,et al.  Job-Shop Scheduling by Implicit Enumeration , 1977 .

[20]  Gu Qingming,et al.  A HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEDULING PROBLEM , 1998 .

[21]  Z.-P. Lo,et al.  Scheduling with neural networks for flexible manufacturing systems , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[22]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[23]  R K Ay T E N T U,et al.  A Problem Space Genetic Algorithm in Multiobjective Optimization , 2002 .

[24]  Dirk C. Mattfeld,et al.  Evolutionary Search and the Job Shop - Investigations on Genetic Algorithms for Production Scheduling , 1996, Production and Logistics.

[25]  Michael E. Wall,et al.  Galib: a c++ library of genetic algorithm components , 1996 .

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

[27]  C. Bierwirth.  A generalized permutation approach to job shop scheduling with genetic algorithms , 1995 .

[28]  Marcel Rijckaert,et al.  The Job Shop Problem Solved with Simple, Basic Evolutionary Search Elements , 1999, GECCO.

[29]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[30]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[31]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .