✦ LIBER ✦

On robust online scheduling algorithms

✍ Scribed by Michael Gatto; Peter Widmayer

Book ID: 106429615
Publisher: Springer US
Year: 2009
Tongue: English
Weight: 803 KB
Volume: 14
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-009-0115-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Preemptive Online Scheduling: Optimal Al

Preemptive Online Scheduling: Optimal Algorithms for

✍ Tomáš Ebenlendr; Wojciech Jawor; Jiří Sgall 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 425 KB

Scheduling with conflicts: online and of

Scheduling with conflicts: online and offline algorithms

✍ Guy Even; Magnús M. Halldórsson; Lotem Kaplan; Dana Ron 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 812 KB

Optimal Online Algorithms for Minimax Re

Optimal Online Algorithms for Minimax Resource Scheduling

✍ Hunsaker, Brady; Kleywegt, Anton J.; Savelsbergh, Martin W. P.; Tovey, Craig A. 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 356 KB

Semi-Online Preemptive Scheduling: One A

Semi-Online Preemptive Scheduling: One Algorithm for All Variants

✍ Tomáš Ebenlendr; Jiří Sgall 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 788 KB

Preemptive online algorithms for schedul

Preemptive online algorithms for scheduling with machine cost

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

Semi-Online Algorithms for Parallel Mach

Semi-Online Algorithms for Parallel Machine Scheduling Problems

✍ G. Dósa; Y. He 📂 Article 📅 2004 🏛 Springer Vienna 🌐 English ⚖ 288 KB