✦ LIBER ✦

On the complexity of the single machine scheduling problem minimizing total weighted delay penalty

✍ Scribed by Vásquez, Óscar C.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Common Due Date Assignment to Minimize T

✍ Panwalkar, S. S.; Smith, M. L.; Seidmann, A. 📂 Article 📅 1982 🏛 INFORMS 🌐 English ⚖ 442 KB

Common Due Date Assignment to Minimize T

✍ S. S. Panwalkar, M. L. Smith and A. Seidmann 📂 Article 📅 1982 🏛 INFORMS 🌐 English ⚖ 233 KB

Minimizing total flow time in the single

✍ Chen, W J 📂 Article 📅 2006 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 139 KB

On-line scheduling on a single machine:

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

The single-machine total weighted tardin

✍ Yunqiang Yin; Chin-Chia Wu; Wen-Hsiang Wu; Shuenn-Ren Cheng 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Minimizing the weighted number of early

✍ H.M. Soroush 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 352 KB