𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Advanced Tabu Search Algorithm for the Job Shop Problem

✍ Scribed by Eugeniusz Nowicki; Czesław Smutnicki


Publisher
Springer US
Year
2005
Tongue
English
Weight
902 KB
Volume
8
Category
Article
ISSN
1094-6136

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