×

Tabu search for a class of scheduling problems. (English) Zbl 0775.90237


MSC:

90B35 Deterministic scheduling theory in operations research
90C27 Combinatorial optimization
90-08 Computational methods for problems pertaining to operations research and mathematical programming

Software:

Tabu search
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] V.A. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, 1974). · Zbl 0326.68005
[2] K.R. Baker,Introduction to Sequencing and Scheduling (Wiley, 1974).
[3] F. Glover, Tabu search – Part I, ORSA J. Comput. 1(1989)190–206.
[4] F. Glover, Tabu search – Part II, ORSA J, Comput. 2(1990)4–31. · Zbl 0771.90084
[5] F. Glover and M. Laguna, Target analysis to improve a tabu search method of machine scheduling, Working Paper, Center for Applied Artificial Intelligence, University of Colorado (September 1989). · Zbl 0791.68152
[6] F. Glover and H.J. Greenberg, New approaches for heuristic search: A bilateral linkage with artificial intelligence, Euro. J. Oper Res. 39(1989)119–130. · Zbl 0658.90079 · doi:10.1016/0377-2217(89)90185-9
[7] F. Glover, Tabu search: A tutorial, Working Paper, Center for Applied Artificial Intelligence, University of Colorado (February 1990).
[8] S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983)671–680. · Zbl 1225.90162 · doi:10.1126/science.220.4598.671
[9] M. Laguna and F. Glover, On the target analysis and diversification in tabu search, Working Paper, Graduate Program in Operations Research, The University at Austin (April 1990).
[10] E.L. Mooney and R.L. Rardin, Local improvement heuristics for multiple choice vertex packing problems, Institute for Interdisciplinary Engineering Studies Technical Report CC-90-30, Purdue University (November 1990).
[11] E.L. Mooney, Tabu search heuristics for resource scheduling with course scheduling applications, Ph.D. Dissertation, Purdue University (1991), unpublished.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.