✦ LIBER ✦

The pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine

✍ Scribed by A. A. Lazarev

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Single Machine Batching Problem with

✍ T.C.E. Cheng; C.T. Ng; J.J. Yuan 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 83 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

The strong NP-hardness of the maximum la

✍ Radosław Rudek 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 252 KB

A special case of the single-machine tot

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

Solution of the NP-hard total tardiness

✍ A. A. Lazarev 📂 Article 📅 2007 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 316 KB

A note on the NP–hardness of the consecu

✍ Salim Haddadi 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 53 KB