Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors
- 25 October 1996
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 94 (2) , 242-251
- https://doi.org/10.1016/0377-2217(96)00131-2
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- A linear time algorithm for edge coloring of binomial treesDiscrete Mathematics, 1996
- Complexity of scheduling multiprocessor tasks with prespecified processor allocationsDiscrete Applied Mathematics, 1994
- Scheduling preemptive multiprocessor tasks on dedicated processorsPerformance Evaluation, 1994
- Interval edge coloring of a graph with forbidden colorsDiscrete Mathematics, 1993
- The complexity of scheduling independent two-processor tasks on dedicated processorsInformation Processing Letters, 1987
- Scheduling File TransfersSIAM Journal on Computing, 1985
- NP completeness of finding the chromatic index of regular graphsJournal of Algorithms, 1983
- Scheduling subject to resource constraints: classification and complexityDiscrete Applied Mathematics, 1983
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- Open Shop Scheduling to Minimize Finish TimeJournal of the ACM, 1976