- 1
-
L. Bianco, J. B
azewicz, P. Dell'Olmo, and M. Drozdowski.
Preemptive multiprocessor task scheduling with release times and time
windows.
Ann. Oper. Res., 70:43-55, 1997.
- 2
-
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.
- 3
-
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.
- 4
-
M. Kubale.
Preemptive scheduling of two-processor tasks on dedicated processors.
Zeszyty Naukowe Politechnik: Slaskiej, Seria: Automatyka Z.
100, 1082:145-153, 1990.
- 5
-
C. Oguz and X. Qi.
Preemptive scheduling multiprocessor tasks to minimize total weighted
completion time on two dedicated processors.
In Proc. 10th International Workshop on Project Management and
Scheduling, pages 270-274, Poznan, Poland, 2006.
WWW daemon apache
2009-06-29