A polynomial feasibility test for preemptive periodic scheduling of unrelated processors
- 30 November 1985
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 12 (3) , 195-201
- https://doi.org/10.1016/0166-218x(85)90024-1
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1983
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear ProgrammingJournal of the ACM, 1978
- Open Shop Scheduling to Minimize Finish TimeJournal of the ACM, 1976
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973