๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Preemptive online scheduling with rejection of unit jobs on two uniformly related machines

โœ Scribed by Leah Epstein, Hanan Zebedat-Haider

Book ID
120729814
Publisher
Springer US
Year
2013
Tongue
English
Weight
333 KB
Volume
17
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Online real-time preemptive scheduling o
Online real-time preemptive scheduling of jobs with deadlines on multiple machines
โœ Bhaskar Das Gupta; Michael A. Palis ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Springer US ๐ŸŒ English โš– 139 KB

In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized in terms of their minimum stretch factor (or, equivalently, their maximum execution rate r = 1= ). We consider two well-