✦ LIBER ✦

The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times

✍ Scribed by Rudek, Radosław

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling problems with position depend

✍ Radosław Rudek 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 755 KB

Makespan minimization flowshop with posi

✍ Rudek, Agnieszka; Rudek, Radosław 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 329 KB

Minimizing the number of tardy jobs on a

✍ Gur Mosheiov; Daniel Oron 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 121 KB

Computational complexity of the single p

✍ Rudek, R 📂 Article 📅 2014 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 165 KB

On single processor scheduling problems

✍ Rudek, Radosław 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 268 KB

A note on proving the strong NP-hardness

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