Scheduling on a hypercube
- 30 December 1991
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 40 (6) , 323-328
- https://doi.org/10.1016/0020-0190(91)90201-r
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An O(n log n) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercubeInformation Processing Letters, 1990
- Preemptive scheduling of independent jobs on a hypercubeInformation Processing Letters, 1988
- Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory ConstraintsOperations Research, 1985
- The cosmic cubeCommunications of the ACM, 1985
- Combinatorial Optimization with Rational Objective FunctionsMathematics of Operations Research, 1979
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975