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

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. Mascis and Pacciarelli 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.