Bibliography

1

J. Bazewicz, P. Dell' Olmo, M. Drozdowski, and M.G. Speranza.
Scheduling multiprocessor tasks on three dedicated processors.
Inf. Process. Lett., 41(5):275-280, 1992.

2

J. Bazewicz, P. Dell' Olmo, M. Drozdowski, and M.G. Speranza.
Corrigendum to: Scheduling multiprocessor tasks on three dedicated processors.
Inf. Process. Lett., 49(5):269-270, 1994.

3

J. Bazewicz, J.K. Lenstra, and A.H.G. Rinnooy Kan.
Scheduling subject to resource constraints: classification and complexity.
Discrete Appl. Math., 5(1):11-24, 1983.

4

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

5

X. Cai, C.-Y. Lee, and C.-L. Li.
Minimizing total completion time in two-processor task systems with prespecified processor allocations.
Naval Res. Logist., 45(2):231-242, 1998.

6

J.A. Hoogeveen, S.L. van de Velde, and B. Veltman.
Complexity of scheduling multiprocessor tasks with prespecified processor allocations.
Discrete Appl. Math., 55(3):259-272, 1994.