Lee, Chung-Yee; Cheng, T. C. E.; Lin, B. M. T. - In: Management Science 39 (1993) 5, pp. 616-625
This paper considers minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. After problem formulation, we present a proof to show that the general version of this problem is strongly NP-complete. We then discuss a few polynomially solvable cases of the problem and...