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

A new local search algorithm for the job shop scheduling problem

โœ Scribed by Huang Wen-qi; Yin Ai-hua


Publisher
Wuhan University
Year
2003
Tongue
English
Weight
535 KB
Volume
8
Category
Article
ISSN
1007-1202

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