Refining scheduling policies with genetic algorithms
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
Genetic algorithms were intensively investigated in various modifications and in combinations with other algorithms for solving the NP-hard scheduling problem. This extended abstract describes a genetic algorithm approach for solving large job shop problems that uses hints from the schedule evaluation in the genetic operators. The result is a hybrid genetic algorithm with smaller randomness and more managed search to find better solutions in shorter processing time. The hybridized genetic algorithm was tested with data from wafer production with thousands of jobs and hundreds of machine alternatives. The hybridized genetic algorithm not only achieved smaller tardiness in shorter computation time but was also able to reduce the sequence dependent change-over times between jobs in comparison with the classical genetic algorithm.