Efficiency and effectiveness of normal schedules on three dedicated processors
- 10 February 1997
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 164 (1-3) , 67-79
- https://doi.org/10.1016/s0012-365x(97)84781-4
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Comparability graph augmentation for some multiprocessor scheduling problemsDiscrete Applied Mathematics, 1997
- Scheduling independent tasks with multiple modesDiscrete Applied Mathematics, 1995
- An approximation algorithm for scheduling on three dedicated machinesDiscrete Applied Mathematics, 1995
- Complexity of scheduling multiprocessor tasks with prespecified processor allocationsDiscrete Applied Mathematics, 1994
- Nonpreemptive scheduling of independent tasks with prespecified processor allocationsNaval Research Logistics (NRL), 1994
- Scheduling multiprocessor tasks on three dedicated processorsInformation Processing Letters, 1992
- Complexity of Scheduling Parallel Task SystemsSIAM Journal on Discrete Mathematics, 1989
- The complexity of scheduling independent two-processor tasks on dedicated processorsInformation Processing Letters, 1987
- Scheduling Multiprocessor Tasks to Minimize Schedule LengthIEEE Transactions on Computers, 1986
- Scheduling subject to resource constraints: classification and complexityDiscrete Applied Mathematics, 1983