Bibliography

1

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

2

S.A. Kravchenko.
A polynomial algorithm for a two-machine no-wait job-shop scheduling problem.
European J. Oper. Res., 106:101-107, 1998.

3

W. Kubiak.
A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem.
European J. Oper. Res., 43(3):267-270, 1989.

4

H. Röck.
Some new results in flow shop scheduling.
Z. Oper. Res. Ser. A-B, 28(1):1-16, 1984.

5

S. Sahni and Y. Cho.
Complexity of scheduling shops with no wait in process.
Math. Oper. Res., 4(4):448-457, 1979.

6

C. Sriskandarajah and P. Ladet.
Some no-wait shops scheduling problems: complexity aspect.
European J. Oper. Res., 24(3):424-438, 1986.

7

V.G. Timkovsky.
On the complexity of scheduling an arbitrary system.
Soviet J. Comput. Systems Sci., 23(5):46-52, 1985.

8

V.G. Timkovsky.
Is a unit-time job shop not easier than identical parallel machines?
Discrete Appl. Math., 85(2):149-162, 1998.