𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

✍ Scribed by Rubén Ruiz; Thomas Stützle

Book ID
108118079
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
485 KB
Volume
177
Category
Article
ISSN
0377-2217

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