Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
- 12 November 1993
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 70 (3), 316-326
- https://doi.org/10.1016/0377-2217(93)90243-g
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Fixed Job Scheduling with Two Types of ProcessorsOperations Research, 1992
- When Is the Classroom Assignment Problem Hard?Operations Research, 1992
- On the computational complexity of (maximum) class schedulingEuropean Journal of Operational Research, 1991
- Scheduling jobs with fixed start and end timesDiscrete Applied Mathematics, 1987
- The Complexity of Coloring Circular Arcs and ChordsSIAM Journal on Algebraic Discrete Methods, 1980
- An Optimal Solution for the Channel-Assignment ProblemIEEE Transactions on Computers, 1979
- Minimal Resources for Fixed and Variable Job SchedulesOperations Research, 1978
- Coloring a Family of Circular ArcsSIAM Journal on Applied Mathematics, 1975