✦ LIBER ✦

A Lower Bound for Scheduling Mechanisms

✍ Scribed by George Christodoulou; Elias Koutsoupias; Angelina Vidali

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound for randomized on-line mul

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

Lower bounds for single-machine scheduli

✍ Reza H. Ahmadi; Uttarayan Bagchi 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 588 KB

A new lower bound for the job-shop sched

✍ Peter Brucker; Bernd Jurisch 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 611 KB

An improved lower bound for a bi-criteri

✍ Jin Yan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 133 KB

Infinite split scheduling: a new lower b

✍ Rabia Nessah; Chengbin Chu 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 414 KB

Lower bounds for on-line single-machine

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