Bibliography

1

P. Baptiste.
A note on scheduling multiprocessor tasks with identical processing times.
Comput. Oper. Res., 30(13):2071-2078, 2003.

2

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

3

P. Baptiste and B. Schieber.
A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness.
J. Sched., 6(4):395-404, 2003.

4

J. Bazewicz and Z. Liu.
Scheduling multiprocessor tasks with chain constraints.
European J. Oper. Res., 94(2):231-241, 1996.

5

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.

6

P. Brucker, J. Hurink, and S. Knust.
A polynomial algorithm for ${P}\vert p_j=1, r_j, outtree\vert\sum{C}_j$.
Math. Methods Oper. Res., 56(3):407-412, 2002.

7

P. Brucker, S. Knust, D. Roper, and Y. Zinder.
Scheduling UET task systems with concurrency on two parallel identical processors.
Math. Methods Oper. Res., 53(3):369-387, 2000.

8

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.

9

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.

10

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

11

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

12

G.I. Davida and D.J. Linton.
A new algorithm for the scheduling of tree structured tasks.
In Proc. Conf. Inform. Sci. and Syst., pages 543-548, Baltimore, MD, 1976.

13

M. Dror, W. Kubiak, and P. Dell' Olmo.
Strong-weak chain constrained scheduling.
Ricerca Operativa, 27:35-49, 1998.

14

M. Drozdowski and P. Dell' Olmo.
Scheduling multiprocessor tasks for mean flow time criterion.
Comput. Oper. Res., 27(6):571-585, 2000.

15

J. Du and J.Y.-T. Leung.
Complexity of scheduling parallel task systems.
SIAM J. Discrete Math., 2(4):473-487, 1989.

16

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.

17

M.R. Garey and D.S. Johnson.
Two-processor scheduling with start-times and deadlines.
SIAM J. Comput., 6(3):416-426, 1977.

18

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

19

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

20

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.

21

C.-Y. Lee and X. Cai.
Scheduling one and two-processor tasks on two parallel processors.
IIE Transactions on Scheduling and Logistics, 31:445-455, 1999.

22

J.K. Lenstra.
Not published.

23

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

24

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

25

E.L. Lloyd.
Concurrent task systems.
Oper. Res., 29(1):189-201, 1981.

26

C.L. Monma.
Linear-time algorithms for scheduling on parallel processors.
Oper. Res., 30:116-124, 1982.

27

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

28

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

29

Y. Zinder and V.H. Do.
Scheduling UET tasks on two parallel machines with the criteria of makespan and total completion time.
In G. Kendall, E. Burke, S. Petrovic, and M. Gendreau, editors, Multidisciplinary Scheduling: Theory and Applications, pages 83-112. Springer, 2005.

30

Y. Zinder, V.H. Do, and C. Oguz.
Computational complexity of some scheduling problems with multiprocessor tasks.
Discr. Opt., 2(4):391-408, 2005.