Zhao, Chuanli; Tang, Hengyong - In: International Journal of Production Economics 136 (2012) 1, pp. 131-136
constraints. We consider two types of precedence constraints. Under the first type constraints, a successor cannot start on any … constraints is polynomially solvable, and the problem with the second type precedence constraints is NP-hard in the strong sense. …In this paper we investigate two-machine flow shop scheduling problems with deteriorating jobs and chain precedence …