✦ LIBER ✦

MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server

✍ Scribed by Mi-Yi Kim; Young Hoon Lee

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hybrid genetic algorithm to minimize m

✍ Fuh-Der Chou; Pei-Chann Chang; Hui-Mei Wang 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 206 KB

The Bounded Single-Machine Parallel-batc

✍ Jintao Meng; Xiaoxu Lu 📂 Article 📅 2011 🏛 Elsevier ⚖ 688 KB

The bounded single-machine parallel-batc

✍ Q.Q. Nong; C.T. Ng; T.C.E. Cheng 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 155 KB

A branch-and-price algorithm for the gen

✍ Heng-Soon Gan; Andrew Wirth; Amir Abdekhodaee 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Optimal algorithms for online scheduling

✍ Ming Liu; Feifeng Zheng; Chengbin Chu; Yinfeng Xu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 228 KB

A hybrid genetic algorithm for the singl

✍ A. Sioud; M. Gravel; C. Gagné 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 846 KB