✦ LIBER ✦

Online deadline scheduling with preemption penalties

✍ Scribed by Feifeng Zheng; Yinfeng Xu; Chung Keung Poon; E. Zhang; Xiaoping Wu

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 264 KB
Volume: 60
Category: Article
ISSN: 0360-8352
DOI: 10.1016/j.cie.2010.12.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Online Scheduling with Hard Deadlines

✍ Sally A Goldman; Jyoti Parwatikar; Subhash Suri 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 157 KB

We study non-preemptive, online admission control in the hard deadline model: each job must either be serviced prior to its deadline or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it ne

Scheduling with job release dates, deliv

Scheduling with job release dates, delivery times and preemption penalties

✍ Zhaohui Liu; T.C.Edwin Cheng 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 73 KB

We consider in this paper the single-machine preemptive scheduling problem with job release dates, delivery times and preemption penalties, where each time a job is started, whether initially or after preemption, a job-dependent setup must take place. First, we prove that the problem is strongly NP-

Online deadline scheduling on faster mac

Online deadline scheduling on faster machines

✍ Jae-Hoon Kim; Kyung-Yong Chwa 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 112 KB

Online deadline scheduling is to determine which jobs are accepted or rejected, where jobs have the deadline by which they must finish their processing and they arrive in the online fashion. The slack of a job is the gap between its arrival time and the last time when it can first be scheduled to me

Two processor scheduling with limited pr

Two processor scheduling with limited preemption

✍ E.L. Lloyd 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 122 KB

Two processor scheduling with limited pr

Two processor scheduling with limited preemption

✍ Errol L. Lloyd 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 496 KB

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-