Off-line admission control for general scheduling problems
- 1 November 2000
- journal article
- research article
- Published by Wiley in Journal of Scheduling
- Vol. 3 (6) , 365-381
- https://doi.org/10.1002/1099-1425(200011/12)3:6<365::aid-jos56>3.0.co;2-p
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling ProblemsPublished by Springer Nature ,1998
- Task Scheduling in NetworksSIAM Journal on Discrete Mathematics, 1997
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation AlgorithmsMathematics of Operations Research, 1997
- Scheduling-LPs bear probabilities randomized approximations for min-sum criteriaPublished by Springer Nature ,1997
- Random-based scheduling new approximations and LP lower boundsPublished by Springer Nature ,1997
- Scheduling jobs that arrive over timePublished by Springer Nature ,1995
- Randomized rounding: A technique for provably good algorithms and algorithmic proofsCombinatorica, 1987