Tabu Search Modern Heuristic Techniques for Combinatorial Problems

Journal of Intelligent Manufacturing, 2, 63-74.
Laguna, M. and F. Glover (1993) "Integrating Target Analysis and Tabu Search for Improved Scheduling Systems," Expert Systems with Applications: An International Journal. 6, 287-297.
Laguna M., and 1. L. Gonzalez-Velarde (1991) "A Search Heuristic for 1ust-in-Time Scheduling in Parallel Machines," Journal of Intelligent Manufacturing, 2,253-260.
Laguna, M., J. P. Kelly, J. L. Gonzalez-Velarde, and F. Glover (1991) "Tabu Search for the Multilevel Generalized Assignment Problem," Graduate School of Business and Administration, University of Colol'lldo at Boulder.
Liepins, G. and M. D. Vose (1990) "Representational Issues in Genetic Optimization," Journal of Exl,erimental and Theoretical Artificial Intelligence. 2,101-115.
Matsuo, H., C. J. Suh, and R. S. Sullivan (1988) "A Controlled Search Simulated Annealing Method for the General Jobshop Scheduling Problem," Graduate School of Business, The University of Texas at Austin.
Malek. M., M. Guruswamy, M. Pandya. and H Owens (1989) "Serial and Parallel Simulated Annealing and Tabu Search Algorithms for the Traveling Salesman Problem," Annals of Operations Research, 21. 59-84.
Tabl4Search I 61

Oliveira, S. and G. Stroud (1989) "A Parallel Version of Tabu Search and the Path Assignment Problem," Heuristics for Combinatorial Optimization, 4, 1-24.

Osman, I. H. (1993) "Metastrategy Simulated Annealing and Tabu Se,arch Algorithms for the Vehicle Routing Problem," Annals of Operations Research. 41, 421-452.
Reeves, C. (1992) "Improving the Efficiency of Tabu Search for Machine Sequencing Problems,," to appear in

Journal of the Operations Research Society.
Ryan, J. (1992) "Depth and Width of Local Optima," Department of Mathematics, University of Colomdo at

~nver.
Semet, F. and E. Taillard (1993) "Solving Real-Life Vehicle Routing Problems Efficiently Using 1~aboo Search," Annals of Operations Research. 41, 469-488.

Skorin-Kapov, J. (1990) "Tabu Search Applied to the Quadratic Assignment Problem," ORSA Journal on

Computing, 2,33-45.
Sun, M and P. G. McKeown (1993) "Tabu Search Applied to the General Fixed Charge Problem," Annals of Operations Research. 41, 405-420.
Taillard, E. (1990) "Some Efficient Heuristic MedIods for the Flowshop Sequencing Problem," European Journal of Operations Research, 47, 65-74.
Taillard, E. (1991) "Robust Taboo Search for the Quadratic Assignment Problem," Parallel Compi~ting, 17, 443-

455.
van Laarhoven, P. J. M., E. H. L. Aarts, and J. K. Lenstra (1992) "Job Shop Scheduling by Simulated Annealing," Operations Research. 40: 1, 113-125.

Ulder, N. L. J., E. Pesch, P. J. M. van Laarhoven, H. J. Bandelt, and E. H. L. Aarts (1991) "Genetic; Local Search Algorithm for the Tmveling Salesman Problem, "Parallel Problem Solving from Nature, R. Maenner and H. P. Schwefel, eds., Lectures in Computer Science 496, Springer-Verlag, 109-116.
Verdejo, V. V. and R. M. Cunquero (1992) "An Application of the Tabu Thresholding Techniques: Minimization of the Number of Arc Crossing in an Acyclic Digraph," Departamento de Estadistica e Investigacion

Operativa, Universidad de Valencia, Spain.

62 I GLOVER and LAGUNA

Whitley, D., T. Starkweather, andD. Shaner (1991) "The Traveling Salesman and Sequence Scheduling: Quality

Solutions Using Genetic Edge Recombination," Handbook of Genetic Algorithms, L. Davis (ed.), Van Nosuand Reinhold

Widmer, M., (1991) "Job Shop Scheduling with Tooling Consuaints: a Tabu Search Approach," Journal of the Operational Research Society, 24:1, 75-82.

Woodruff, D. L. and M. L. Speannan (1992) "Sequencing and Batching for Two Classes of Jobs witbl Deadlines and Setup Times," Production and Operations Management, 1:1,87-102.
Woodruff, D. L. and E. Zemel (1993) "Hashing Vectors for Tabu Search," Annals of Operations Research. 41,

123-138.