Investigating Parallel Genetic Algorithms on Job Shop Scheduling Problems

This paper describes a GA for job shop scheduling problems. Using the Giffler and Thompson algorithm, we created two new operators, THX crossover and mutation, which better transmit temporal relationships in the schedule. The approach produced excellent results on standard benchmark job shop scheduling problems. We further tested many models and scales of parallel GAs in the context of job shop scheduling problems. In our experiments, the hybrid model consisting of coarse-grain GAs connected in a fine-grain-GA-style topology performed best, appearing to integrate successfully the advantages of coarse-grain and fine-grain GAs.

• Type: Conference
• Year: 1997
• Where: EPS
• Authors: Shyh-Chang Lin, Erik D. Goodman, William F. Punch III
• Keywords: Benchmark Job Shop, EPS 1997, EPS 1998, Job Shop Scheduling, Shop Scheduling Problems