✦ LIBER ✦

A linear time approximation algorithm for movement minimization in conveyor flow shop processing

✍ Scribed by W. Espelage; E. Wanke

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time approximation algorithm fo

✍ Marcus Poggi; David Sotelo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 249 KB

Makespan Minimization in Job Shops: A Li

✍ Jansen, Klaus; Solis-Oba, Roberto; Sviridenko, Maxim 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 167 KB

Makespan Minimization in No-Wait Flow Sh

✍ Sviridenko, M. 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 149 KB

A modified genetic algorithm for the flo

✍ Lixin Tang; Jiyin Liu 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 141 KB

Genetic algorithms for minimizing makesp

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

An approximation algorithm for the m-mac

✍ Eugeniusz Nowicki 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 423 KB