✦ LIBER ✦

Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard

✍ Scribed by Wan, Long; Yuan, Jinjiang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single machine scheduling with controlla

✍ Kayvanfar, Vahid; Mahdavi, Iraj; Komaki, GH.M. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 320 KB

Single machine scheduling to minimize to

✍ Guohua Wan; Benjamin P.-C. Yen 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 191 KB

A special case of the single-machine tot

✍ E. R. Gafarov; A. A. Lazarev 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 249 KB

Algorithms for solving the NP-hard probl

✍ A. A. Lazarev; A. G. Kvaratskheliya; E. R. Gafarov 📂 Article 📅 2007 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 185 KB

Single-machine scheduling to minimize ea

✍ T. C. E. Cheng; H. G. Kahlbacher 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 605 KB

Single machine scheduling to minimize th

✍ Avital Lann; Gur Mosheiov 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 913 KB