𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Discrepancy search for the flexible job shop scheduling problem

✍ Scribed by Abir Ben Hmida; Mohamed Haouari; Marie-José Huguet; Pierre Lopez


Book ID
108106970
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
535 KB
Volume
37
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Problem difficulty for tabu search in jo
✍ Jean-Paul Watson; J.Christopher Beck; Adele E. Howe; L.Darrell Whitley 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 402 KB

Tabu search algorithms are among the most effective approaches for solving the job-shop scheduling problem (JSP). Yet, we have little understanding of why these algorithms work so well, and under what conditions. We develop a model of problem difficulty for tabu search in the JSP, borrowing from sim