✦ LIBER ✦

Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem

✍ Scribed by Eva Vallada; Rubén Ruiz

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hybrid genetic local search algorithm

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

A branch and bound algorithm to minimize

✍ Chia-Shin Chung; James Flynn; Ömer Kirca 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 158 KB

Parallel path relinking method for the s

✍ Wojciech Bożejko 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 218 KB

An asynchronous genetic local search alg

✍ Xiao Xu; Zhenhao Xu; Xingsheng Gu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 625 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 Particle Swarm Optimization Algorithm

✍ Yannis Marinakis; Magdalene Marinaki 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 392 KB