A new neighborhood structure for the job shop scheduling problem

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.