A tabu search algorithm for no-wait job shop scheduling problem (Q2627474)

Summary: In this paper, we consider no-wait job shop scheduling problem with makespan objective. In the no-wait problem two consecutive operations in each job must be processed without any interruption. No-wait job shop problem is strongly NP-hard. \textit{A. Mascis} and \textit{D. Pacciarelli} [Eur. J. Oper. Res. 143, No. 3, 498--517 (2002; Zbl 1082.90528)] proposed an algorithm for no-wait job shop problem that produces good quality solution for benchmark problems but it mostly failed in finding a feasible solution. Therefore, we introduce a new neighbourhood structure in our tabu search to resolve this problem.