✦ LIBER ✦

Online scheduling with reassignment

✍ Scribed by Zhiyi Tan; Shaohua Yu

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 148 KB
Volume: 36
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2007.06.004

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

Online deadline scheduling with preempti

Online deadline scheduling with preemption penalties

✍ Feifeng Zheng; Yinfeng Xu; Chung Keung Poon; E. Zhang; Xiaoping Wu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 264 KB

Semi-online scheduling with machine cost

✍ Yong He; Shengyi Cai 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 468 KB

Scheduling with conflicts: online and of

Scheduling with conflicts: online and offline algorithms

✍ Guy Even; Magnús M. Halldórsson; Lotem Kaplan; Dana Ron 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 812 KB

Optimal semi-online algorithm for schedu

Optimal semi-online algorithm for scheduling with

✍ Xiao Min; Jing Liu; Yuqing Wang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 358 KB

Online interval scheduling: randomized

✍ Stanley P. Y. Fung; Chung Keung Poon; Feifeng Zheng 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 325 KB