Preemptive scheduling in overloaded systems
Under an Elsevier user license
open archive
Keywords
Scheduling
Online algorithms
Deadline
Resource augmentation
Cited by (0)
- 1
Supported by NSF Grant CCR-9988360.
- 2
Supported by cooperative Grant KONTAKT-ME476/CCR-9988360-001 from MŠMT ČR and NSF.
- 3
Supported by the Israel Science Foundation, Grant 250/01-1.
- 4
Supported by Institute for Theoretical Computer Science, Prague (project LN00A056 of MŠMT ČR), Grant 201/01/1195 of GA ČR, and Grant A1019901 of GA AV ČR.
- 5
Supported by the Deutsche Forschungsgemeinschaft, Project AL 464/3-1, and by the European Community, Projects APPOL and APPOL II. Author's current affiliation: Centre for Mathematics and Computer Science (CWI), Kruislaan 413, NL-1098 SJ Amsterdam, The Netherlands.
- 6
Supported by NSF-CONACyT Grant E120.1914.
Copyright © 2003 Elsevier Inc. All rights reserved.