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 and S. Knust.
Complexity results for single-machine problems with positive finish-start time-lags.
Computing, 63:299-316, 1999.

4

P. Brucker and A. Krämer.
Shop scheduling problems with multiprocessor tasks on dedicated processors.
Ann. Oper. Res., 57:13-27, 1995.

5

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

6

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

7

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

8

A. Krämer.
Scheduling multiprocessortasks on dedicated processors.
PhD thesis, Universität Osnabrück, Fachbereich Mathematik/Informatik, 1995.

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

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

14

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.

15

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

16

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.