𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems

✍ Scribed by V. P. Eswaramurthy; A. Tamilarasi

Publisher
Springer
Year
2008
Tongue
English
Weight
250 KB
Volume
40
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Problem difficulty for tabu search in jo
Problem difficulty for tabu search in job-shop scheduling
✍ 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