✦ LIBER ✦

GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times

✍ Scribed by F. J. Rodriguez, C. Blum, C. García-Martínez, M. Lozano

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel path relinking method for the s

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

A heuristic for a batch processing machi

✍ Pei-Chann Chang; Hui-Mei Wang 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 289 KB

Algorithms for the single machine total

✍ Fuh-Der Chou; Hui-Mei Wang; Tzu-Yun Chang 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 275 KB

Shortest path to nonpreemptive schedules

✍ Philippe Baptiste; Vadim G. Timkovsky 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 309 KB

Genetic algorithm for minimizing the tot

✍ Chin-Chia Wu; Peng-Hsiang Hsu; Juei-Chao Chen; Nae-Sheng Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Minimizing makespan and total completion

✍ Bayi Cheng; Shanlin Yang; Xiaoxuan Hu; Bo Chen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 241 KB