✦ LIBER ✦

Non-approximability of just-in-time scheduling

✍ Scribed by Matthias Müller-Hannemann; Alexander Sonnikow

Book ID: 106429619
Publisher: Springer US
Year: 2009
Tongue: English
Weight: 342 KB
Volume: 12
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-009-0120-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

General scheduling non-approximability r

General scheduling non-approximability results in presence of hierarchical communications

✍ R. Giroudeau; J.C. König 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 544 KB

Exploiting slack time for just-in-time s

Exploiting slack time for just-in-time scheduling in

✍ Ke Liu; Nael Abu-Ghazaleh; Kyoung-Don Kang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 927 KB

The maximum deviation just-in-time sched

The maximum deviation just-in-time scheduling problem

✍ N. Brauner; Y. Crama 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 363 KB

This note revisits the maximum deviation just-in-time (MDJIT) scheduling problem previously investigated by Steiner and Yeomans. Its main result is a set of algebraic necessary and su cient conditions for the existence of a MDJIT schedule with a given objective function value. These conditions are u

Just in Time: Improving Scheduled Cesare

Just in Time: Improving Scheduled Cesarean Start Times : Professional Issues

✍ Marsha Rodgers; Liane L. Jennings; Myra D. Hale 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB

Makespan minimization of multi-slot just

Makespan minimization of multi-slot just-in-time scheduling on

✍ Dariusz Dereniowski; Wiesław Kubiak 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 654 KB

Just-in-time scheduling with controllabl

Just-in-time scheduling with controllable processing times on parallel machines

✍ Yaron Leyvand; Dvir Shabtay; George Steiner; Liron Yedidsion 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 529 KB