DocumentCode
3010754
Title
A Hybrid and Flexible Genetic Algorithm for the Job-Shop Scheduling Problem
Author
Ferrolho, António ; Crisóstomo, Manuel
Author_Institution
Polytech Inst. of Viseu, Viseu
fYear
2007
fDate
20-23 June 2007
Firstpage
421
Lastpage
426
Abstract
A hybrid and flexible genetic algorithm (HybFlexGA) is presented for the job-shop scheduling problem (JSSP). The JSSP is one of the most difficult production scheduling problems in industry because it requires very large combinational search space and the precedence constraint between machines. The computational results on the well-known benchmark instances show the proposed HybFlexGA is very effective and competitive with other methods presented in the literature.
Keywords
genetic algorithms; job shop scheduling; combinational search space; flexible genetic algorithm; job-shop scheduling problem; production scheduling problems; Artificial neural networks; Computational intelligence; Genetic algorithms; Heuristic algorithms; Job shop scheduling; Processor scheduling; Robotics and automation; Simulated annealing; Single machine scheduling; USA Councils;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence in Robotics and Automation, 2007. CIRA 2007. International Symposium on
Conference_Location
Jacksonville, FI
Print_ISBN
1-4244-0790-7
Electronic_ISBN
1-4244-0790-7
Type
conf
DOI
10.1109/CIRA.2007.382867
Filename
4269867
Link To Document