Title :
A new neighborhood structure for the job shop scheduling problem
Author_Institution :
UFsoft Sch. of Software, Jiangxi Univ. of Finance & Econ., China
Abstract :
The job shop scheduling problem minimizing the make-span is discussed. Two important theorems about feasible solution of the problem are proved. Based on these two theorems, a new kind of neighborhood structure is proposed for local search algorithms, and the efficiency of this neighborhood structure is analyzed.
Keywords :
job shop scheduling; search problems; job shop scheduling problem; local search algorithms; neighborhood structure; Algorithm design and analysis; Finance; Finishing; Forward contracts; Heuristic algorithms; Iterative algorithms; Job shop scheduling; Machinery production industries; Performance analysis; Search methods;
Conference_Titel :
Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on
Print_ISBN :
0-7803-8403-2
DOI :
10.1109/ICMLC.2004.1382143
