✦ LIBER ✦

Improved Bounds for the Online Scheduling Problem

✍ Scribed by Rudin, John F.; Chandrasekaran, R.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved bounds for online scheduling wi

✍ Kyungkuk Lim; Kangbok Lee; Soo Y. Chang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 481 KB

Better Bounds for Online Scheduling

✍ Albers, Susanne 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 350 KB

Improved Bounds on Relaxations of a Para

✍ Cynthia A. Phillips; Andreas S. Schulz; David B. Shmoys; Cliff Stein; Joel Wein 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 131 KB

Improved lower bounds for semi-online bi

✍ János Balogh; József Békési; Gábor Galambos; Mihály Csaba Markót 📂 Article 📅 2009 🏛 Springer Vienna 🌐 English ⚖ 151 KB

Improved Bounds for Acyclic Job Shop Sch

✍ Uriel Feige; Christian Scheideler 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 446 KB

An improved lower bound for a bi-criteri

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