๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A hybrid scatter search for the partial job shop scheduling problem

โœ Scribed by Mohammad Mahdi Nasiri; Farhad Kianfar


Publisher
Springer
Year
2010
Tongue
English
Weight
595 KB
Volume
52
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