✦ LIBER ✦

Generalized preemption models for single-machine dynamic scheduling problems

✍ Scribed by FRANC¸OIS M. JULIEN; MICHAEL J. MAGAZINE; NICHOLAS G. HALL

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation results for a bicriteria j

✍ Eric Angel; Evripidis Bampis; Laurent Gourvès 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 137 KB

Evolving scheduling rules with gene expr

✍ Li Nie; Xinyu Shao; Liang Gao; Weidong Li 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 345 KB

Lower bounds for single-machine scheduli

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

A dynamic programming method for single

✍ Toshihide Ibaraki; Yuichi Nakamura 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 642 KB

Improved algorithms for two single machi

✍ Yong He; Weiya Zhong; Huikun Gu 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 225 KB

Solution of the generalized Townsend sin

✍ Wlodzimierz Szwarc; Samar K. Mukhopadhyay 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 468 KB