Bibliography

1

P. Brucker, S.A. Kravchenko, and Y.N. Sotskov.
Preemptive job-shop scheduling problems with a fixed number of jobs.
Math. Methods Oper. Res., 49(1):41-76, 1999.

2

J.K. Lenstra.
Not published.

3

J.K. Lenstra and A.H.G. Rinnooy Kan.
Computational complexity of discrete optimization problems.
Ann. Discrete Math., 4:121-140, 1979.

4

M. Middendorf and V.G. Timkovsky.
Transversal graphs for partially ordered sets: sequencing, merging and scheduling problems.
J. Comb. Optim., 3(4):417-435, 1999.

5

Y.N. Sotskov.
The complexity of shop-scheduling problems with two or three jobs.
European J. Oper. Res., 53(3):326-336, 1991.