DocumentCode
3392764
Title
Solving the Flexible Open-Job Shop Scheduling Problem with GRASP and Simulated Annealing
Author
Witkowski, Tadeusz ; Antczak, Pawel ; Antczak, Arkadiusz
Author_Institution
Warsaw Univ. of Technol., Warsaw, Poland
Volume
2
fYear
2010
fDate
23-24 Oct. 2010
Firstpage
437
Lastpage
442
Abstract
In the paper the flexible open - job shop scheduling problem FOJSP (an extension of the classical job shop scheduling) is analyzed. For the optimization of the production process to make span the GRASP and Simulated Annealing algorithms have been used. Different “open” rates have been considered and compared. The presented algorithms have been implemented, tested, and illustrated with examples for serial and parallel routes.
Keywords
job shop scheduling; search problems; simulated annealing; GRASP; flexible open job shop scheduling; greedy randomized adaptive search procedure; optimization; production process; simulated annealing; Adaptation model; Approximation algorithms; Computational modeling; Job shop scheduling; Schedules; Simulated annealing; GRASP; makespan; metaheuristic; open job shop; simulated annealing;
fLanguage
English
Publisher
ieee
Conference_Titel
Artificial Intelligence and Computational Intelligence (AICI), 2010 International Conference on
Conference_Location
Sanya
Print_ISBN
978-1-4244-8432-4
Type
conf
DOI
10.1109/AICI.2010.212
Filename
5655185
Link To Document