✦ LIBER ✦

A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times

✍ Scribed by Radosław Rudek

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on proving the strong NP-hardness

✍ Radosław Rudek 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 116 KB

The strong NP-hardness of the maximum la

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

A note on “Single-machine scheduling pro

✍ Yu-Bin Wu, Zheng-Yi Piao, Huan Liu, Ping Ji 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 215 KB