✦ LIBER ✦

An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling

✍ Scribed by Dipak Laha; Uday Kumar Chakraborty

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A constructive heuristic for minimizing

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

An Effective Hybrid Heuristic for Flow S

✍ D.-Z. Zheng; L. Wang 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 101 KB

An efficient bi-objective heuristic for

✍ S. M. Mousavi; M. Zandieh; M. Amiri 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 905 KB

An efficient approach to simplify the ca

✍ Shouwei Gao; Weidong Zhang 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 230 KB

A new heuristic for minimizing total com

✍ Dipak Laha; Arindam Chakravorty 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 155 KB

An efficient heuristic approach to total

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