✦ LIBER ✦

Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information

✍ Scribed by Yiwei Jiang; Yong He

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal algorithms for semi-online preem

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

Optimal semi-online algorithm for schedu

✍ Xiao Min; Jing Liu; Yuqing Wang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 358 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

Optimal Preemptive Online Algorithms for

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

An optimal semi-online algorithm for 2-m

✍ Hongying Li; Chunjie Su 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 444 KB