Bibliography

1
P. Brucker, S. Knust, and G. Wang.
Complexity results for flow-shop problems with a single server.
European J. Oper. Res., 165(2):398-407, 2005.

2
M.R. Garey, D.S. Johnson, and R. Sethi.
The complexity of flowshop and jobshop scheduling.
Math. Oper. Res., 1(2):117-129, 1976.

3
S.M. Johnson.
Optimal two-and-three-stage production schedules with set-up times included.
Naval Res. Logist. Quart., 1:61-68, 1954.

4
J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker.
Complexity of machine scheduling problems.
Ann. of Discrete Math., 1:343-362, 1977.


WWW daemon apache 2009-06-29