Tabu Search Candidate List Strategies in Scheduling
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.
KeywordsSchedule Problem Tabu Search Candidate List Choice Rule Good Move
Unable to display preview. Download preview PDF.
- Baar, T., R Brucker and S. Knust, (1997). “Tabu-Search Algorithms for the Resource-Constrained Project Scheduling Problem, ” Technical Report, Universität Osnabrück.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- Glover, F. and M. Laguna, (1997). Tabu Search,Kluwer Academic Publishers.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- Morton and Pentico, (1993). Heuristic Scheduling Systems, Wiley Series in Engineering and Technology Management, New York.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar