Bibliography

1

P. Brucker and A. Krämer.
Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems.
European J. Oper. Res., 90:214-226, 1996.

2

P. Brucker, S.A. Kravchenko, and Y.N. Sotskov.
On the complexity of two machine job-shop scheduling with regular objective functions.
OR Spektrum, 19(1):5-10, 1997.

3

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

4

S.A. Kravchenko.
Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem.
Discrete Appl. Math., 98(3):209-217, 1999.

5

W. Kubiak and V.G. Timkovsky.
A polynomial-time algorithm for total completion time minimization in two-machine job-shop with unit-time operations.
European J. Oper. Res., 94:310-320, 1996.

6

J.K. Lenstra.
Not published.

7

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

8

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.

9

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

10

Y.N. Sotskov and N.V. Shakhlevich.
NP-hardness of shop-scheduling problems with three jobs.
Discrete Appl. Math., 59(3):237-266, 1995.

11

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

12

V.G. Timkovsky.
A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem.
Discrete Appl. Math., 77(2):185-200, 1997.

13

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