Approximating the throughput of multiple machines under real-time scheduling
- 1 May 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 622-631
- https://doi.org/10.1145/301250.301420
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Efficient On-Line Call Control AlgorithmsJournal of Algorithms, 1997
- On-line competitive algorithms for call admission in optical networksPublished by Springer Nature ,1996
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time SystemsSIAM Journal on Computing, 1995
- 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
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobsAnnals of Operations Research, 1990
- Scheduling jobs with fixed start and end timesDiscrete Applied Mathematics, 1987
- Two-Processor Scheduling with Start-Times and DeadlinesSIAM Journal on Computing, 1977
- Algorithms for Scheduling Independent TasksJournal of the ACM, 1976