Bibliography

1

P. Baptiste, P. Brucker, S. Knust, and V. Timkovsky.
Ten notes on equal-execution-time scheduling.
4OR, 2:111-127, 2004.

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

J. Hurink and S. Knust.
Flow-shop problems with transportation times and a single robot.
Discrete Applied Mathematics, 112(1-3):199-216, 2001.

4

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

5

H. Kise.
On an automated two-machine flowshop scheduling problem with infinite buffer.
J. Oper. Res. Soc. Japan, 34(3):354-361, 1991.

6

S. Knust.
Shop-scheduling problems with transportation.
PhD thesis, Universität Osnabrück, Fachbereich Mathematik/Informatik, 1999.

7

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