Title :
A new encoding scheme for solving job shop problems by genetic algorithm
Author :
Shi, Guoyong ; Iima, Hitoshi ; Sannomiya, Nobuo
Author_Institution :
Dept. of Electron. & Inf. Sci., Kyoto Inst. of Technol., Japan
Abstract :
A new encoding scheme in genetic algorithms is proposed by using an ordering string for the classic job shop scheduling problem. A genetic algorithm is designed for searching the semi-active schedule space, which is encoded by the string space. A new crossover, set-partition crossover is introduced in accompanying the genetic searching. An associated selection strategy and a production structure are properly established for this fashion of encoding. This encoding scheme naturally overcomes the infeasibility problem in genetic iterations. Experiments show that the proposed genetic algorithm is effective, and optimal solutions are attainable in some probability for Fisher and Thompson problems with definite hardness
Keywords :
encoding; genetic algorithms; matrix algebra; production control; search problems; definite hardness; encoding scheme; genetic algorithm; infeasibility problem; job shop scheduling problem; ordering string; production structure; selection strategy; semi-active schedule space; set-partition crossover; Algorithm design and analysis; Encoding; Genetic algorithms; Information science; Job shop scheduling; Optimal scheduling; Processor scheduling; Production; Scheduling algorithm; Space technology;
Conference_Titel :
Decision and Control, 1996., Proceedings of the 35th IEEE Conference on
Conference_Location :
Kobe
Print_ISBN :
0-7803-3590-2
DOI :
10.1109/CDC.1996.577484