✦ LIBER ✦

Makespan minimization flowshop with position dependent job processing times—computational complexity and solution algorithms

✍ Scribed by Rudek, Agnieszka; Rudek, Radosław

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The computational complexity analysis of

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

Scheduling problems with position depend

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

Computational complexity of the single p

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

Minimizing the number of tardy jobs on a

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