✦ LIBER ✦

On‐line approximation algorithms for scheduling tasks on identical machines withextendable working time

✍ Scribed by M.G. Speranza; Zs. Tuza

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms for Time-Constr

✍ Harald Räcke; Adi Rosén 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 740 KB

Randomized truthful algorithms for sched

✍ Eric Angel; Evripidis Bampis; Nicolas Thibault 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 280 KB

On-Line Load Balancing of Temporary Task

✍ Azar, Yossi; Epstein, Leah 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 115 KB

Approximation Schemes for Scheduling on

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

Scheduling jobs within time windows on i

✍ Virginie Gabrel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 764 KB

An approximation algorithm for identical

✍ Hans Kellerer 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 119 KB