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

A machine-order search space for job-shop scheduling problems

โœ Scribed by S. H. Choi; F. Y. Yang


Book ID
108572843
Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
155 KB
Volume
10
Category
Article
ISSN
0969-6016

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