✦ LIBER ✦

A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan

✍ Scribed by Liu, Peihai; Lu, Xiwen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling Three-Operation Jobs in a Two

✍ Jatinder N.D. Gupta; Christos P. Koulamas; George J. Kyparisis; Chris N. Potts; 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 135 KB

A Genetic Algorithm for Flow Shop Schedu

✍ Bhongade, A. S.; Khodke, P. M. 📂 Article 📅 2014 🏛 Springer-Verlag 🌐 English ⚖ 872 KB

A hybrid algorithm to minimize makespan

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

A best possible deterministic on-line al

✍ Peihai Liu; Xiwen Lu; Yang Fang 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 283 KB

Two approximation algorithms for two-age

✍ Zhao, Kejun; Lu, Xiwen 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 449 KB

Genetic algorithms for minimizing makesp

✍ Praveen Kumar Manjeshwar; Purushothaman Damodaran; Krishnaswami Srihari 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 258 KB