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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baar, T., R Brucker and S. Knust, (1997). “Tabu-Search Algorithms for the Resource-Constrained Project Scheduling Problem, ” Technical Report, Universität Osnabrück.
Dell’Amico, M. and M. Trubian, (1993). “Applying tabu search to the job-shop scheduling problem,” Annals of Operations Research 41, pp. 231–252.
Demeulemeester, E. and W. Herroelen, (1992). “ A branch-and-bound procedure for the multiple resource-constrained project scheduling problem,” Management Science 38, pp. 1803–1818.
James, R. J. W., J. T. Buchanan (1997). “Performance Enhancements to Tabu Search for the Early/Tardy Scheduling Problem, ” To appear in the European Journal of Operational Research, Special Issue on Tabu Search.
Glover, F., (1992). “Ejection chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems,” University of Colorado. Shortened version published in Discrete Applied Mathematics 65, (1996), pp. 223–253.
Glover, F., (1996). “Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges, ” Interfaces in Computer Science and Operations Research. Barr, Helgason and Kennington, eds., Kluwer Academic Publishers.
Glover, F. and M. Laguna, (1997). Tabu Search,Kluwer Academic Publishers.
Glover, E (1997). Tabu Search, To appear in the European Journal of Operational Research, Special Issue on Tabu Search.
Kolisch, R., A. Sprecher, A. Drexl, (1995). “Characterization and generation of a general class of resource-constrained project scheduling problems,” Management Science 41, pp. 1693–1703.
Lokketangen, A. and Glover, F. “ Candidate list and exploration strategies for solving 0\ 1 MIP problems using a pivot neighborhood,” MIC-97 Second International Conference on Metaheuristics, Versailles, France, July 21–24, 1997.
Minghe Sun, J. E. Aronson, P. McKeown and D. Drinka (1997). “A Tabu Search Heuristic Procedure for the FCT Problem,” To appear in the European Journal of Operational Research, Special Issue on Tabu Search.
Mingozzi, A., V. Maniezzo, S. Ricciardelli and L. Bianco, (1994). “An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation,” Technical Report n.32, Department of Mathematics, University of Bologna, Italy.
Morton and Pentico, (1993). Heuristic Scheduling Systems, Wiley Series in Engineering and Technology Management, New York.
Nowicki, E. and C. Smutnicki, (1996). “A Fast Taboo Search Algorithm for the job shop problem, ” Management Science 42, 797–813.
Rego, C. (1997). “Relaxed Tours and Path Ejections for the Traveling Salesman Problems, ” Universidade Portucalense, Portgual, To appear in the European Journal of Operational Research.
Sampson, S. E. and E. N. Weiss, (1993). “ Local Search Techniques for the Generalized Resource Constrained Project Scheduling Problem, ”Naval Research Logistics 40\5,pp. 665–676.
Woodruff, D. L. and M. L. Spearman (1992). “ Sequencing and Batching for Two Classes of Jobs with Deadlines and Setup Times, ” Production and Operations Management, 1\1, pp. 87–102.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Rangaswamy, B., Jain, A.S., Glover, F. (1998). Tabu Search Candidate List Strategies in Scheduling. In: Woodruff, D.L. (eds) Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search. Operations Research/Computer Science Interfaces Series, vol 9. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2807-1_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2807-1_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5023-9
Online ISBN: 978-1-4757-2807-1
eBook Packages: Springer Book Archive