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

A tabu search procedure for periodic job shop scheduling

โœ Scribed by Ju-Seog Song; Tae-Eog Lee


Book ID
107965907
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
1011 KB
Volume
30
Category
Article
ISSN
0360-8352

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