Complexity of Scheduling Parallel Task Systems
- 1 November 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 2 (4) , 473-487
- https://doi.org/10.1137/0402042
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Scheduling Multiprocessor Tasks to Minimize Schedule LengthIEEE Transactions on Computers, 1986
- Preemptive Scheduling of Uniform Processor SystemsJournal of the ACM, 1978
- A Level Algorithm for Preemptive SchedulingJournal of the ACM, 1977
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959