| Tabu Search Candidate List Strategies in Scheduling (2007) | |||||||||||||||
Abstract | |||||||||||||||
| Candidate list strategies form an important cornerstone of Tabu Search (TS), yet are often neglected in TS research. In this paper, we review candidate list construction principles and illustrate basic concepts through simple numerical examples from the resource-constrained scheduling domain. We also provide computational results which document that significant gains are made possible by intelligent implementations of candidate list strategies, even where other Tabu Search components are restricted to relatively simple levels. key words: candidate list strategies, meta-heuristics, tabu search, resource-constrained scheduling # Accepted for publication at the 6 th INFORMS Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search: Interfaces in Computer Science and Operations Research Conference in Monterrey Bay, California, January 1998. Proceedings edited by David L. Woodruff, Kluwer Academic Publishers. + This work has been sponsored by the Roy... | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||