An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops (Q2482377)

The author considers the problem of minimizing makespan in a two-machine no-wait job shop environment. A two-phase heuristic is developed. In the first phase the problem is reduced to a two-machine no-wait flow shop scheduling problem which is solved by the well known algorithm \textit{P. C. Gilmore} and \textit{R. E. Gomory} [Oper. Res. 12, 655--679 (1964; Zbl 0126.36006)]. In the second phase the obtained solution is improved using a tabu search algorithm. The author describes the experiments and evaluates the performance of the proposed heuristic.