Abstract
During the last five years, tabu search has been shown to be a remarkably effective method in solving difficult problems in the timely and very important area of production scheduling. In this paper, we present an overview of the research that has contributed to that success. We also review the various techniques that have been employed, giving attention to advances that have led to major improvements and suggesting directions for future research.
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.
Bibliography
Adams, J., E. Balas and D. Zawack, “The Shifting Bottleneck Procedure for Job Shop Scheduling”, Management Science, ,vol. 34, no. 3, March, 1988.
Applegate, D. and W. Cook, “A Computational Study of the Job Shop Scheduling Problem,”, ORSA Journal on Computing, ,Vol. 3, No. 2, 1991.
Applegate, D., Personal correspondence, 1991.
Baker, Kenneth R. , Introduction to Sequencing and Scheduling, John Wiley Publishers, (1974).
Baker, K.R. and G.D. Scudder, “Sequencing With Earliness and Tardiness Penalties: A Review”, Operations Research, vol. 38, pp. 22–36, 1990.
Balas, E., “Finding a Minimaximal Path in a Disjunctive PERT Network,”, Theorie des Graphes Journees internationales d’tude, Rome Juillet 1966, Dunod, Paris - Gordon and Beach, pp. 21–30, New York, 1967.
Balas, E., “Machine Sequencing via Disjunctive Graphs: An Implicit Enumeration Algorithm”, Operations Research, vol. 17, pp. 941–957, 1969.
Barnes, J.W. and J. Brennan, “An Improved Algorithm for Scheduling Jobs on Identical Machines,”, AILE Transactions, vol. 9, no. 1, March, 1977.
Barnes, J.W. and L. Vanston, “Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Set-Up Costs,”, Journal of Operations Research, vol. 29, no. 1, January-February, 1981.
Barnes, J.W. and M. Laguna, “Solving the Multiple-Machine Weighted Flow Time Problem Using Tabu Search”, IIE Transactions, in press, 1992.
Barnes, J.W. and J. Chambers, “Solving the Job Shop Scheduling Problem Using Tabu Search”, Technical Report Series, Graduate Program in Operations Research, The University of Texas at Austin, ORP91–06,1992.
Beardwood, J., J.H. Halton, and J.M. Hammersley, “The Shortest Path through Many Points”, Proceedings of the Cambridge Philosophical Society, vol. 55, pp. 299–327, 1959.
Brandimarte, P„ “Routing and Scheduling in a Flexible Job Shop by Tabu Search,” Dipartimento di Sistemi di Produzione, Politecnico di Torino, Torino, Italy, 1992.
Conway, R.W., W.L. Maxwell, and L.W. Miller, Theory of Scheduling, Addison-Wesley, Reading, Mass., 1970.
de Werra, D. and A. Hertz, “Tabu Search Techniques: A Tutorial and an Application to Neural Networks”, OR Spectrum, vol. 11, pp. 131–141, 1989.
Dell’Amico, M. and M. Trubian, “Applying Tabu-Search to the Job-Shop Scheduling Problem,” to appear, Annals of Operations Research, 1992.
Evans, J., “Structural Analysis of Local Search Heuristics in Combinatorial Optimization,”, Computers and Operations Research, vol. 14, no. 6, pp. 465–477, 1987.
Feo, T.F. and M. Resende, “A Probabilistic Heuristic for a Computationally Difficult Set Covering Problem”, Operations Research Letters, vol. 8, pp. 67–71, 1989.
Fiechter, C-N. “A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems”, Research Report ORWP 90/1,Ecole Polytechnique Federale de Lausanne, Departement de Mathematiques, February, 1990.
French, S., Sequencing and Scheduling, Ellis Horwood Limited, 1982.
Gendreau, M., A. Hertz, and G. Laporte, “A Tabu Search Heuristic for the Vehicle Routing Problem,” Centre de recherche sur les transports, Universite de Montreal, publication #777, June 1991.
Gendreau, M., A. Hertz, and G. Laporte, “New Insertion and Post-Optimization Procedures for the Traveling Salesman Problem,” Centre de recherche sur les transports, Universite de Montreal, CRT-708, 1990.
Glover, F., “Heuristics for Integer Programming Using Surrogate Constraints”, Decision Sciences, vol 8, no. 1, pp. 156–166, 1977.
Glover, F., “Future Paths for Integer Programming and Links to Artificial Intelligence”, Computers and Operations Research, vol. 13, no. 5, pp. 533–549, 1986.
Glover, F., “Tabu Search - Part I”, ORSA Journal on Computing, vol. 1, no. 3, pp. 190–206, Summer 1989.
Glover, F., “Tabu Search - Part II”, ORSA Journal on Computing, vol. 2, no. 1, pp. 4–32, Winter 1990a.
Glover, F., “Tabu Search: A Tutorial”, Interfaces, vol. 20, no. 4, pp. 74–94, July - August 1990b.
Glover, F., “Multilevel Tabu Search and Embedded Search Neighborhoods for the Traveling Salesman Problem,” Graduate School of Business and Administration, University of Colorado at Boulder, June 1991.
Glover, F. and M. Laguna, “Tabu Search”, University of Colorado at Boulder, 1992.
Glover, F., E. Taillard, and D de Werra, “A User’s Guide to Tabu Search,” Graduate School of Business and Administration, University of Colorado at Boulder, November 1991.
Hertz, A. and D. de Werra, “The Tabu Search Metaheuristic: How we use it”, Research Report ORWP 88/13, Ecole Polytechnique Federale de Lausanne, Departement de Mathematiques, March 1989, to appear in, Annals of Mathematics and Artificial Intelligence, .
Johnson, D., “Local Optimization and the Traveling Salesman Problem,”, Proceedings of the 17th Annual Colloquim on Automata, Languages and Programming, Springer-Verlag, pp. 446–461, 1990.
Knox, J. and F. Glover, “Tabu Search, An Effective Heuristic for Combinatorial Optimization Problems”, Center for Applied Artificial Intelligence, University of Colorado, Boulder, Colorado, March, 1988.
Knox, J. and F. Glover, “Comparative Testing of Traveling Salesman Heuristics Derived form Tabu Search, Genetic Algorithms, and Simulated Annealing”, Center for Applied Artificial Intelligence, University of Colorado, Boulder, Colorado, September, 1989.
Laguna, M., J. W. Barnes and F. Glover, “Tabu Search Methods for a Single Machine Scheduling Problem,”, Journal of Intelligent Manufacturing, vol. 2, pp. 63–73, 1991.
Laguna, M., and J. L. Gonzalez-Velarde, “A Search Heuristic for Just-in-Time Scheduling in Parallel Machines”, Journal of Intelligent Manufacturing, vol. 2, pp. 253–260, 1991.
Laguna, M., J. P. Kelly, J. L. Gonzalez-Velarde, and F. Glover, “Tabu Search for the Multilevel Generalized Assignment Problem,” Graduate School of Business and Administration, University of Colorado at Boulder, November 1991.
Laguna, M., “Tabu Search Primer,” Graduate School of Business and Administration, University of Colorado at Boulder, March 1992.
Laguna, M., J. W. Barnes and F. Glover, “Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs and Times Using Tabu Search”, Applied Intelligence, in press, 1992.
Laguna, M. and F. Glover, “Integrating Target Analysis and Tabu Search for Improved Scheduling Systems”, Experts Systems with Applications: An International Journal, in press, 1992.
Lam, J., “An Efficient Simulated Annealing Schedule,” PH.D. Dissertation, Report 8818, Department of Computer Science, Yale University, September 1988.
Lawler, E.L., J.K. Lenstra, A. Rinnooy Kan, and D.B. Shmoys, “Sequencing and Scheduling: Algorithms and Complexity”, Report BS-R8909, Centre for Mathematics and Computer Science, Amsterdam, Netherlands, 1989.
Lawler, E.L., J.K. Lenstra, A. Rinnooy Kan, and D.B. Shmoys, The traveling Salesman Problem, A Guided Tour of Combinatorial Optimization, Wiley-Interscience Pub., 1990.
Lawrence, S., Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques, GSIA, Carnegie Mellon University, 1984.
Lin, S. and B. Kernighan, “An Effective Heuristic Algorithm for the Traveling Salesman Problem,”, Operations Research, vol. 21, pp. 498–516, 1973.
Malek, M., M. Guruswamy, H. Owens, and M. Pandya, “Serial and Parallel Search Techniques for Traveling Salesman Problem”, Annals of OR: Linkages with Artificial Intelligence, vol. 21, pp. 59–84, 1989a.
Malek, M., M. Guruswamy, H. Owens, and M. Pandya, “A Hybrid Algorithm Technique,” Report TR-89–06, Department of Computer Sciences, The University of Texas at Austin, Austin,Texas, March 1989b
Matsuo, H., C. Suh, and R. Sullivan, “A Controlled Search Simulated Annealing Method for the General Jobshop Scheduling Problem,” Working Paper 03–44–88, Graduate School of Business, University of Texas at Austin.
Morin, T.L. and R.E. Marsten, “Branch and Bound Strategies for Dynamic Programming”, Operations Research, vol. 24, no. 4, pp. 611–627, 1976.
Muhlenbein, H., “Parallel Genetic Algorithms and Combinatorial Optimization,” to appear, in SIAM Journal on Optimization, .
Muth, J. and G. Thompson, Industrial Scheduling, Prentice-Hall, Englewood Cliffs, N.J., 1963.
Nawaz, M., E. Enscore, and I. Ham, “A Heuristic Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem,”, OMEGA, vol. 11, no. 1, 1983.
Osman, I. H., “Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem,” to appear, in Annals of Operations Research, 1992.
Padberg, M. and G. Rinaldi, “A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems,” SIAM Review, vol. 33, no. 1, pp. 60–100, 1989.
Roy, B. and B. Sussman, “Les problemes d’ordonnancements avec contraintes disjonctives,” Notes DS n 9 bis, SEMA, Paris, 1964.
Semet, F. and E. Taillard, “Solving Real-Life Vehicle Routing Problems Efficiently Using Tabu Search,” Ecole Polytechnique Fédérale de Lausanne, ORWP 91/03, April 1991.
Stewart, W.R., Jr., “Accelerated Branch Exchange Heuristics for Symmetric Traveling Salesman Problems”, Networks, vol. 17, pp. 423–437, 1987.
Taïllard, E., “Parallel Taboo Search Technique for the Job Shop Scheduling Problem”, Research Report ORWP 89/11, Ecole Polytechnique Federale de Lausanne, Departement de Mathematiques, July 1989.
Troyon, M., “Quelques Heuristiques et Resultats Asymptotiques por trois Problemes d’Optimisation Combinatoire,” These No. 754, Ecole Polytechnique Federale de Lausanne, Lausanne, Switzerland, 1988.
Tsubakitani, S. and J. R. Evans, “Optimizing Tabu List Size for the Traveling Salesman Problem,” College of Business Administration, University of Cincinnati, June 1991.
Ulder, N., E. Aarts, H. Bandelt, P. van Laarhoven, and E. Pesch, “Genetic Local Search Algorithms for the Traveling Salesman Problem,”, Lecture Notes in Computer Science, Vol. 496, Springer, Berlin, pp. 109–116, 1991.
van Laarhoven, P., E. Aarts, and J. Lenstra, “Job Shop Scheduling by Simulated Annealing”, Report OS-R8809, Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, 1988.
Whitley, D., “Solving Generic Scheduling Problems Using Genetic Algorithms,” Technical Report: CIAI-TR-89–04, Colorado Institute of Artificial Intelligence, Boulder, Colorado, 1989.
Widmer, M. and A. Hertz, “A New Method for the Flow Sequencing Problem”, European Journal of Operations Research, vol. 41, pp. 186–193, 1989.
Widmer, M., “Job Shop Scheduling with Tooling Constraints: a Tabu Search Approach,”, Journal of the Operational Research Society, vol. 24, no. 1, pp. 75–82, 1991.
Woodruff, D. L. and M. L. Spearman, “Sequencing and Batching for Two Classes of Jobs with Deadlines and Setup Times,”, Journal of the Production and Operations Management Society, in press, 1992.
Woodruff, D. L. and E. Zemel, “Hashing Vectors for Tabu Search,”, Annals of Operations Research, in press, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this chapter
Cite this chapter
Barnes, J.W., Laguna, M., Glover, F. (1995). An Overview of Tabu Search Approaches to Production Scheduling Problems. In: Brown, D.E., Scherer, W.T. (eds) Intelligent Scheduling Systems. Operations Research / Computer Science Interfaces Series, vol 3. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2263-8_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2263-8_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5954-8
Online ISBN: 978-1-4615-2263-8
eBook Packages: Springer Book Archive