论文信息 - Genetic algorithm for job shop scheduling problems based on two representational schemes

Genetic algorithm for job shop scheduling problems based on two representational schemes

The Letter explains the application of a genetic algorithm (GA) to job shop scheduling problems with a new crossover and two kinds of mutation based on two representational schemes. Simulation results show that our genetic operators and representational schemes are very powerful and suitable to job shop scheduling problems.

Cheol Hoon Park | Lae-Jeoung Park | C. Park | L. Park

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

[2] Peter Ross,et al. A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems , 1993, ICGA.

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

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