𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Tabu Search Algorithm for Job Shop Scheduling

✍ Scribed by S. G. Ponnambalam; P. Aravindan; S. V. Rajesh


Publisher
Springer
Year
2000
Tongue
English
Weight
108 KB
Volume
16
Category
Article
ISSN
0268-3768

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