An O(n log n) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube
- 15 June 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 35 (1) , 7-11
- https://doi.org/10.1016/0020-0190(90)90166-u
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Preemptive scheduling of independent jobs on a hypercubeInformation Processing Letters, 1988
- Preemptive Scheduling with Due DatesOperations Research, 1979