𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags

✍ Scribed by Hamdi, Imen; Loukil, Taïcir

Book ID
125372933
Publisher
Springer-Verlag
Year
2014
Tongue
English
Weight
284 KB
Volume
9
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-bound algorithm with fuzzy
A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
✍ Jinliang Cheng; Hiroshi Kise; Hironori Matsumoto 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 697 KB

This paper considers an m-machine permutation flowshop scheduling problem of minimizing the makespan. This classical scheduling problem is still important in modem manufacturing systems, and is well known to be intractable (i.e., NP-hard). In fact branch-and-bound algorithms developed so far for thi