✦ LIBER ✦

Solution algorithms for the makespan minimization problem with the general learning model

✍ Scribed by Adam Janiak; Władysław Adam Janiak; Radosław Rudek; Agnieszka Wielgus

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Priority algorithms for makespan minimiz

✍ Oded Regev 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 63 KB

MIP models and hybrid algorithm for mini

✍ Mi-Yi Kim; Young Hoon Lee 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 839 KB

A modified LPT algorithm for the two uni

✍ Christos Koulamas; George J. Kyparisis 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 188 KB

A hybrid algorithm to minimize makespan

✍ Ahmadizar, Fardin; Barzinpour, Farnaz 📂 Article 📅 2010 🏛 Atlantis Press 🌐 English ⚖ 332 KB

A memetic algorithm for the re-entrant p

✍ Xu, Jianyou; Yin, Yunqiang; Cheng, T.C.E.; Wu, Chin-Chia; Gu, Shusheng 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 696 KB

Computational complexity of the single p

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