✦ LIBER ✦

A new ant colony algorithm for makespan minimization in permutation flow shops

✍ Scribed by Fardin Ahmadizar

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the NEH heuristic for minimizing the

✍ Pawel Jan Kalczynski; Jerzy Kamburowski 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 228 KB

An efficient hybrid heuristic for makesp

✍ Dipak Laha; Uday Kumar Chakraborty 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 223 KB

Two ant-colony algorithms for minimizing

✍ Chandrasekharan Rajendran; Hans Ziegler 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 116 KB

Makespan Minimization in No-Wait Flow Sh

✍ Sviridenko, M. 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 149 KB

Genetic algorithms for minimizing makesp

✍ Praveen Kumar Manjeshwar; Purushothaman Damodaran; Krishnaswami Srihari 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 258 KB

A constructive heuristic for minimizing

✍ Dipak Laha; Uday K. Chakraborty 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 219 KB