DocumentCode :
2947594
Title :
Job shop scheduling problems with Genetic Algorithms
Author :
Ferrolho, António ; Crisóstomo, Manuel ; Wójcik, Robert
Author_Institution :
Polytech. Inst. of Viseu, Viseu
fYear :
2007
fDate :
27-29 Nov. 2007
Firstpage :
76
Lastpage :
80
Abstract :
The Job-Shop Scheduling Problem (JSSP) is an extremely difficult problem because it requires very large combinational search space and the precedence constraint between machines. A software tool called Hybrid and Flexible Genetic Algorithm (HybFlexGA) was developed for solving the JSSP. Computational results demonstrate that the proposed HybFlexGA is very efficient and potentially useful in solving the JSSP. The results obtained with standard JSSP benchmark demonstrate its efficiency.
Keywords :
genetic algorithms; job shop scheduling; search problems; HybFlexGA; combinational search space; genetic algorithm; job shop scheduling problem; software tool; Artificial neural networks; Control engineering computing; Control systems; Genetic algorithms; Genetic engineering; Job shop scheduling; Orbital robotics; Robot control; Simulated annealing; Space technology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Engineering & Systems, 2007. ICCES '07. International Conference on
Conference_Location :
Cairo
Print_ISBN :
978-1-4244-1365-2
Electronic_ISBN :
978-1-1244-1366-9
Type :
conf
DOI :
10.1109/ICCES.2007.4447029
Filename :
4447029
Link To Document :
بازگشت