DocumentCode
2773461
Title
Experimental Analysis of a Neighborhood Generation Mechanism Applied to Scheduling Problem
Author
Cruz-Chávez, Marco Antonio ; Frausto-Solis, Juan ; Cora-Mora, Jesus Roberto
Author_Institution
Eng. & Appl. Sci. Res. Center, UAEM, Morelos
Volume
2
fYear
2006
fDate
26-29 Sept. 2006
Firstpage
226
Lastpage
229
Abstract
This paper presents a neighborhood generation mechanism for the job shop scheduling problems (JSSP). In order to obtain a feasible neighbor with the generation mechanism, it is only necessary to generate a permutation of an adjacent pair of operations in a scheduling of the JSSP. If there is no slack-time between the adjacent pair of operations that is permuted, then it is proven, through experimentation that the new neighbor (schedule) generated is feasible
Keywords
graph theory; job shop scheduling; optimisation; search problems; graph theory; job shop scheduling problem; neighborhood generation mechanism; optimisation; permutation; search problem; Automotive engineering; Computer science; Genetic algorithms; Job shop scheduling; Processor scheduling; Robots; Simulated annealing; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronics, Robotics and Automotive Mechanics Conference, 2006
Conference_Location
Cuernavaca
Print_ISBN
0-7695-2569-5
Type
conf
DOI
10.1109/CERMA.2006.112
Filename
4019798
Link To Document