Schuster, Christoph - In: Mathematical Methods of Operations Research 63 (2006) 3, pp. 473-491
This paper deals with the no-wait job shop problem with a makespan objective. We present some new theoretical properties on the complexity of subproblems associated with a well-known decomposition approach. Justified by the complexity results, we implement a fast tabu search algorithm for the...
