✦ LIBER ✦

On the NEH heuristic for minimizing the makespan in permutation flow shops

✍ Scribed by Pawel Jan Kalczynski; Jerzy Kamburowski

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient hybrid heuristic for makesp

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

Stochastically minimizing the makespan i

✍ R. D. Foley; S. Suresh 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 343 KB

A new ant colony algorithm for makespan

✍ Fardin Ahmadizar 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 207 KB

A constructive heuristic for minimizing

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

Efficient composite heuristics for total

✍ Xiaoping Li; Qian Wang; Cheng Wu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 197 KB

Stochastically minimizing the makespan i

✍ Jerzy Kamburowski 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 123 KB