P. Brucker, T.C.E. Cheng, S. Knust, and N.V. Shakhlevich.
Complexity results for flow-shop and open-shop problems with
Annals of Operations Research, 129:81-106, 2004.
M.R. Garey, D.S. Johnson, and R. Sethi.
The complexity of flowshop and jobshop scheduling.
Math. Oper. Res., 1(2):117-129, 1976.
Optimal two-and-three-stage production schedules with set-up times
Naval Res. Logist. Quart., 1:61-68, 1954.
J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker.
Complexity of machine scheduling problems.
Ann. of Discrete Math., 1:343-362, 1977.
The two-machine flow shop problem with delays and the
one-machine total tardiness problem.
PhD thesis, Technische Universiteit Eindhoven, Eindhoven, 1996.
Dissertation, Technische Universiteit Eindhoven, Eindhoven, 1996.
W. Yu, H. Hoogeveen, and J.K. Lenstra.
Minimizing makespan in a two-machine flow shop with delays and
unit-time operations is NP-hard.
J. Sched., 7(5):333-348, 2004.
WWW daemon apache