Approximating the Throughput of Multiple Machines in Real-Time Scheduling
- 1 January 2001
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 31 (2) , 331-352
- https://doi.org/10.1137/s0097539799354138
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Bandwidth Allocation with PreemptionSIAM Journal on Computing, 1999
- A new bound for the ratio between the 2-matching problem and its linear programming relaxationMathematical Programming, 1999
- Efficient On-Line Call Control AlgorithmsJournal of Algorithms, 1997
- Note on scheduling intervals on-lineDiscrete Applied Mathematics, 1995
- Maximizing the value of a space missionEuropean Journal of Operational Research, 1994
- On the competitiveness of on-line real-time task schedulingReal-Time Systems, 1992
- The Fixed Job Schedule Problem with Spread-Time ConstraintsOperations Research, 1987
- Scheduling jobs with fixed start and end timesDiscrete Applied Mathematics, 1987
- Two-Processor Scheduling with Start-Times and DeadlinesSIAM Journal on Computing, 1977
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977