✦ LIBER ✦

Semi-Online Preemptive Scheduling: One Algorithm for All Variants

✍ Scribed by Tomáš Ebenlendr; Jiří Sgall

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Preemptive Online Scheduling: Optimal Al

✍ Tomáš Ebenlendr; Wojciech Jawor; Jiří Sgall 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 425 KB

Optimal algorithms for semi-online preem

✍ Yong He; Yiwei Jiang 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 193 KB

Optimal semi-online algorithms for preem

✍ Yiwei Jiang; Yong He 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 621 KB

Preemptive Semi–online Algorithms for Pa

✍ Yong He; Hao Zhou; Yi Wei Jiang 📂 Article 📅 2006 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 168 KB

Preemptive online algorithms for schedul

✍ Yiwei Jiang; Yong He 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 224 KB

Optimal semi-online algorithm for schedu

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