Bibliography

1

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

2

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.

3

P. Brucker, B. Jurisch, and M. Jurisch.
Open shop problems with unit time operations.
Z. Oper. Res., 37(1):59-73, 1993.

4

E.G. Coffman, Jr. and R.L. Graham.
Optimal scheduling for two-processor systems.
Acta Informat., 1:200-213, 1971/1972.

5

T.C. Hu.
Parallel sequencing and assembly line problems.
Oper. Res., 9:841-848, 1961.

6

W. Kubiak, C. Sriskandarajah, and K. Zaras.
A note on the complexity of openshop scheduling problems.
INFOR, 29(4):284-294, 1991.

7

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

8

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

9

B. Simons.
Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines.
SIAM J. Comput., 12(2):294-299, 1983.

10

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.

11

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