✦ LIBER ✦

A lower bound for on-line scheduling on uniformly related machines

✍ Scribed by Leah Epstein; Jiřı́ Sgall

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for on-line single-machine

✍ Leah Epstein; Rob van Stee 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 158 KB

A better lower bound for on-line schedul

✍ Yair Bartal; Howard Karloff; Yuval Rabani 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 320 KB

A lower bound for randomized on-line sch

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

A lower bound for randomized on-line mul

✍ Jiří Sgall 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 464 KB

Approximation Schemes for Scheduling on

✍ Leah Epstein hanks{School of Computer Science, The Interdisciplinary Center, Her 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 165 KB

New lower and upper bounds for on-line s

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