DocumentCode
1706783
Title
Application of genetic algorithm to scheduling problems in manufacturing processes
Author
Sannomiya, Nobuo ; Iima, Hitoshi
Author_Institution
Dept. of Electron. & Inf. Sci., Kyoto Inst. of Technol., Japan
fYear
1996
Firstpage
523
Lastpage
528
Abstract
A genetic algorithm approach to optimal scheduling in manufacturing processes is considered. The scheduling problem is described as a production ordering problem with many constraints. Various methods of the individual description and the decoding rule are presented to improve the feasibility of the solution. A numerical result is shown for a modified flowshop scheduling problem
Keywords
genetic algorithms; manufacturing processes; process control; production control; decoding rule; genetic algorithm; manufacturing processes; modified flowshop scheduling problem; optimal scheduling; production ordering problem; scheduling problems; Biological cells; Constraint optimization; Decoding; Flexible manufacturing systems; Genetic algorithms; Information science; Job shop scheduling; Manufacturing processes; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 1996., Proceedings of IEEE International Conference on
Conference_Location
Nagoya
Print_ISBN
0-7803-2902-3
Type
conf
DOI
10.1109/ICEC.1996.542654
Filename
542654
Link To Document