A new neighbourhood structure for job shop scheduling problems

Abstract

Job shop scheduling problem (JSP) is a widely studied NP-complete combinatorial optimisation problem. Neighbourhood structures play a critical role in solving JSP. At present, there are three state-of-the-art neighbourhood structures, i.e. N5, N6, and N7. Improving the upper bounds of some famous benchmarks is inseparable from the role of these neighbourhood structures. However, these existing neighbourhood structures only consider the movement of critical operations within a critical block. According to our experiments, it is also possible to improve the makespan of a scheduling scheme by moving a critical operation outside its critical block. According to the above finding, this paper proposes a new N8 neighbourhood structure considering the movement of critical operations within a critical block and the movement of critical operations outside the critical block. Besides, a neighbourhood clipping method is designed to avoid invalid movement, discarding non-improving moves. Tabu search (TS) is a commonly used algorithm framework combined with neighbourhood structures. This paper uses this framework to compare the N8 neighbourhood structure with N5, N6, and N7 neighbourhood structures on four famous benchmarks. The experimental results verify that the N8 neighbourhood structure is more effective and efficient in solving JSP than the other state-of-the-art neighbourhood structures.