✦ LIBER ✦

Improved bounds for online scheduling with eligibility constraints

✍ Scribed by Kyungkuk Lim; Kangbok Lee; Soo Y. Chang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Bounds for the Online Schedulin

✍ Rudin, John F.; Chandrasekaran, R. 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 171 KB

Online scheduling on two uniform machine

✍ Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 545 KB

Better Bounds for Online Scheduling

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

Makespan minimization in online scheduli

✍ Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 518 KB

Optimal parallel machines scheduling wit

✍ Gwo-Ji Sheen; Lu-Wen Liao; Cheng-Feng Lin 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 316 KB

Scheduling jobs with equal processing ti

✍ Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 400 KB