Bibliography

1

J.O. Achugbue and F.Y. Chin.
Scheduling the open shop to minimize mean flow time.
SIAM J. Comput., 11:709-720, 1982.

2

P. Brucker.
Scheduling algorithms.
Springer-Verlag, Berlin, first edition, 1995.

3

P. Brucker, M.R. Garey, and D.S. Johnson.
Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness.
Math. Oper. Res., 2(3):275-284, 1977.

4

P. Brucker, B. Jurisch, and A. Krämer.
Complexity of scheduling problems with multi-purpose machines.
Ann. Oper. Res., 70:57-73, 1997.

5

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

6

T. Gonzalez and S. Sahni.
Open shop scheduling to minimize finish time.
J. Assoc. Comput. Mach., 23(4):665-679, 1976.

7

B. Jurisch.
Lower bounds for the job-shop scheduling problem on multi-purpose machines.
Discrete Appl. Math., 58(2):145-156, 1995.

8

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.

9

S.A. Kravchenko.
On the complexity of minimizing the number of late jobs in unit time open shops.
Discrete Appl. Math., 100(2):127-132, 1999.

10

E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan.
Minimizing maximum lateness in a two-machine open shop.
Math. Oper. Res., 6(1):153-158, 1981.

11

E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan.
Erratum: ``Minimizing maximum lateness in a two-machine open shop'' [Math. Oper. Res. 6 (1981), no. 1, 153-158].
Math. Oper. Res., 7(4):635, 1982.

12

J.K. Lenstra.
Not published.

13

J.K. Lenstra and A.H.G. Rinnooy Kan.
Complexity of scheduling under precedence constraints.
Oper. Res., 26(1):22-35, 1978.

14

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

15

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

16

W. Meyer.
Geometrische Methoden zur Lösung von Job-Shop Problemen und deren Verallgemeinerungen.
PhD thesis, Universität Osnabrück, Fachbereich Mathematik/Informatik, 1992.

17

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

18

V.S. Tanaev, Y.N. Sotskov, and V.A. Strusevich.
Scheduling theory. Multi-stage systems, volume 285 of Mathematics and its Applications.
Kluwer Academic Publishers Group, Dordrecht, 1994.
Translated and revised from the 1989 Russian original by the authors.

19

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

20

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

21

V.G. Timkovsky.
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity.
European J. Oper. Res., 149(2):355-376, 2003.

22

J.D. Ullman.
NP-complete scheduling problems.
J. Comput. System Sci., 10:384-393, 1975.