The complexity of scheduling independent two-processor tasks on dedicated processors
- 13 February 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 24 (3) , 141-147
- https://doi.org/10.1016/0020-0190(87)90176-1
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Scheduling Multiprocessor Tasks to Minimize Schedule LengthIEEE Transactions on Computers, 1986
- An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer SystemsIEEE Transactions on Computers, 1985
- Scheduling independent 2-processor tasks to minimize schedule lengthInformation Processing Letters, 1984
- On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline IntervalsOperations Research, 1984
- On Edge Coloring Bipartite GraphsSIAM Journal on Computing, 1982
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- Linear algorithms for edge-coloring trees and unicyclic graphsInformation Processing Letters, 1979