Bibliography

1

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.

2

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

3

J. Bruno, E.G. Coffman, Jr., and R. Sethi.
Scheduling independent tasks to reduce mean finishing time.
Comm. ACM, 17:382-387, 1974.

4

J. Du, J.Y.-T. Leung, and G.H. Young.
Scheduling chain-structured tasks to minimize makespan and mean flow time.
Inform. and Comput., 92(2):219-236, 1991.

5

M.R. Garey and D.S. Johnson.
``Strong'' NP-completeness results: motivation, examples, and implications.
J. Assoc. Comput. Mach., 25(3):499-508, 1978.

6

W.A. Horn.
Minimizing average flow time with parallel machines.
Oper. Res., 21:846-847, 1973.

7

W. Kubiak.
Exact and approximate algorithms for scheduling unit time tasks with tree-like precedence constraints.
In Abstracts EURO IX - TIMS XXVIII Paris, 195, 1988.

8

J.K. Lenstra.
Not published.

9

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

10

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

11

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

12

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