✦ LIBER ✦

A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound for on-line scheduling on

✍ Leah Epstein; Jiřı́ Sgall 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 75 KB

A lower bound for randomized on-line sch

✍ Bo Chen; André van Vliet; Gerhard J. Woeginger 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 293 KB

Lower bounds for online makespan minimiz

✍ JeÅ¼, Åukasz; Schwartz, Jarett; Sgall, JiÅÃ; BÃ©kÃ©si, JÃ³zsef 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 604 KB

Approximation results for a bicriteria j

✍ Eric Angel; Evripidis Bampis; Laurent Gourvès 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 137 KB

Optimal online algorithms for scheduling

✍ Yi-wei Jiang; Yong He; Chun-mei Tang 📂 Article 📅 2006 🏛 SP Zhejiang University Press 🌐 English ⚖ 215 KB

Optimal algorithms for online scheduling

✍ Ming Liu; Feifeng Zheng; Chengbin Chu; Yinfeng Xu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 228 KB