Comparability graph augmentation for some multiprocessor scheduling problems
- 1 January 1997
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 72 (1-2) , 71-84
- https://doi.org/10.1016/s0166-218x(96)00037-6
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Efficiency and effectiveness of normal schedules on three dedicated processorsDiscrete Mathematics, 1997
- Complexity of scheduling multiprocessor tasks with prespecified processor allocationsDiscrete Applied Mathematics, 1994
- Scheduling multiprocessor tasks on three dedicated processorsInformation Processing Letters, 1992
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengthsEuropean Journal of Operational Research, 1991
- The complexity of scheduling independent two-processor tasks on dedicated processorsInformation Processing Letters, 1987
- A Branch-and-Bound Algorithm for the Continuous-Process Job-Shop Scheduling ProblemA I I E Transactions, 1970