✦ LIBER ✦

A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan

✍ Scribed by Xu, Jianyou; Yin, Yunqiang; Cheng, T.C.E.; Wu, Chin-Chia; Gu, Shusheng

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hybrid algorithm to minimize makespan

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

A scatter search algorithm for the distr

✍ Naderi, Bahman; Ruiz, Rubén 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 563 KB

A block mining and re-combination enhanc

✍ Chang, Pei-Chann; Huang, Wei-Hsiu; Wu, Jheng-Long; Cheng, T.C.E. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 447 KB

A hybrid genetic local search algorithm

✍ Lin-Yu Tseng; Ya-Tai Lin 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 250 KB

A simple and effective iterated greedy a

✍ Rubén Ruiz; Thomas Stützle 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 485 KB

A bounded-search iterated greedy algorit

✍ Fernandez-Viagas, Victor; Framinan, Jose M. 📂 Article 📅 2014 🏛 Taylor and Francis Group 🌐 English ⚖ 919 KB