✦ LIBER ✦

Scheduling problems with position dependent job processing times: computational complexity results

✍ Scribed by Radosław Rudek

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

Makespan minimization flowshop with posi

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

Flow shop scheduling jobs with position-

✍ Ji-Bo Wang 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 129 KB

Scheduling on parallel identical machine

✍ Enrique Gerstl; Gur Mosheiov 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 146 KB

Single machine scheduling problems with

✍ Zhao, Chuanli; Tang, Hengyong 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 534 KB

Scheduling job shop problems with sequen

✍ Naderi, B.; Zandieh, M.; Fatemi Ghomi, S.M.T. 📂 Article 📅 2009 🏛 Taylor and Francis Group 🌐 English ⚖ 847 KB