✦ LIBER ✦

Optimizing blocking flow shop scheduling problem with total completion time criterion

✍ Scribed by Moslehi, Ghasem; Khorasanian, Danial

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An ordered flow-shop sequencing problem

✍ PANWALKAR, S. S.; KHAN, A. W. 📂 Article 📅 1976 🏛 Taylor and Francis Group 🌐 English ⚖ 199 KB

Minimizing total completion time for re-

✍ Caixia Jing; Wanzhen Huang; Guochun Tang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 244 KB

The two-machine total completion time fl

✍ F. Della Croce; V. Narayan; R. Tadei 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 691 KB

Discrete harmony search algorithm for th

✍ Kai-zhou Gao; Quan-ke Pan; Jun-qing Li 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 487 KB

An effective heuristic for flow shop pro

✍ Venkateswara S. Vempati; Chuen-Lung Chen; Stanley F. Bullington 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 302 KB

The permutation flow shop problem with s

✍ Selcuk Karabati; Panagiotis Kouvelis 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 938 KB