✦ LIBER ✦

Minimizing completion time for a class of scheduling problems

✍ Scribed by Ulrich Faigle; Rainer Schrader

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A dominant class of schedules for mallea

✍ Ruslan Sadykov 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 396 KB

Minimizing total completion time for re-

✍ Caixia Jing; Wanzhen Huang; Guochun Tang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 244 KB

A priority rule for minimizing weighted

✍ S.T. Webster 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 541 KB

On-line scheduling on a single machine:

✍ Amos Fiat; Gerhard J. Woeginger 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 65 KB

A new heuristic for minimizing total com

✍ Dipak Laha; Arindam Chakravorty 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 155 KB

On-line scheduling of unit time jobs wit

✍ Leah Epstein; John Noga; Gerhard J. Woeginger 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 142 KB