✦ LIBER ✦

A note on the complexity of flow shop scheduling with transportation constraints

✍ Scribed by Jinjiang Yuan; Ameur Soukhal; Youjun Chen; Lingfa Lu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on Heuristics of Flow-Shop Schedu

✍ Lai, Tsung-Chyan 📂 Article 📅 1996 🏛 INFORMS 🌐 English ⚖ 397 KB

A note on two-machine no-wait flow shop

✍ Chuanli Zhao; Hengyong Tang 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 220 KB

A note on flow-shop and job-shop batch s

✍ Gur Mosheiov; Daniel Oron 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 310 KB

A note on “Two-machine flow-shop schedul

✍ T'kindt, V.; Della Croce, F. 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 102 KB

On the Complexity of Non-preemptive Shop

✍ Tamás Kis 📂 Article 📅 2002 🏛 Springer Vienna 🌐 English ⚖ 149 KB

A discrete time exact solution approach

✍ C. Gicquel; L. Hege; M. Minoux; W. van Canneyt 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 191 KB