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, C. Dhaenens-Flipo, S. Knust, S.A. Kravchenko, and F. Werner.
Complexity results for parallel machine problems with a single server.
J. Sched., 5(6):429-457, 2002.

3

P. Brucker and S.A. Kravchenko.
Scheduling jobs with release times on parallel machines to minimize total tardiness.
OSM Reihe P, Heft 258, Universität Osnabrück, Fachbereich Mathematik/Informatik, 2005.

4

P. Brucker and S.A. Kravchenko.
Scheduling jobs with equal processing times and time windows on identical parallel machines.
J. Sched., 11:229-237, 2008.

5

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

6

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

7

N. Hall, C.N. Potts, and C. Sriskandarajah.
Parallel machine scheduling with a common server.
Discrete Appl. Math., 102(3):223-243, 2000.

8

S.A. Kravchenko and F. Werner.
Parallel machine scheduling problems with a single server.
Math. Comput. Modelling, 26(12):1-11, 1997.

9

E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys.
Sequencing and Scheduling: Algorithms and Complexity, volume 4 of Operations Research and Managment Science.
CWI, Amsterdam, 1989.

10

J.K. Lenstra.
Not published.

11

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