Abstract
Using a simple multiprocessor scheduling problem as a vehicle, we explore the behavior of tabu search algorithms using different tabu, local search and list management strategies. We found that random blocking of the tail of the tabu list always improved performance; but that the use of frequency-based penalties to discourage frequently selected moves did not. Hash coding without conflict resolution was an effective way to represent solutions on the tabu list. We also found that the most effective length of the tabu list depended on features of the algorithm being used, but not on the size and complexity of the problem being solved. The best combination of features included random blocking of the tabu list, tasks as tabus and a greedy local search. An algorithm using these features was found to outperform a recently published algorithm solving a similar problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anderson, Charles A., Kathryn Fraughnaugh, Mark Parker, and Jennifer Ryan. (1993). “Path Assignment for Call Routing: An Application of Tabu Search,” Annals of Operations Research41, 301-312.
Barnes, J.W. and M. Laguna. (1993). “A Tabu Search Experience in Production Scheduling,” Annals of Operations Research41, 141-156.
Barnes, J.W., M. Laguna, and F. Glover. (1995). “An Overview of Tabu Search Approaches to Production Scheduling Problems.” In D.E. Brown and W.T. Scherer (eds.), Intelligent Scheduling System. Kluwer Academic Publishers, pp. 101-127.
Blazewicz, J., K.E. Ecker E. Pesch, G. Schmidt, and J. Weglarz. (1995). Scheduling Computer and Manufacturing Processes. Berlin: Springer-Verlag.
Glover, F. (1986). “Future Paths for Integer Programming and Links to Artificial Intelligence,” Computers and Operations Research13, 533-549.
Glover, F. (1995). “Tabu Search Fundamentals and Uses, Revised and Expanded: April 1995.” Technical Report, Graduate School of Business, University of Colorado, Bolder, CO.
Glover, F. and M. Laguna. (1997). Tabu Search. Boston: Kluwer Academic Publishers.
Graham, R.L. (1969). “Bounds for Certain Multiprocessing Anomalities,” SIAM J. Appl. Math. 17, 263-269.
Graham, R.L. (1976). “Bounds on Performance of Scheduling Algorithms.” In E.G. Coffman, Jr. (ed.), Scheduling in Computer and Job Shop Systems. Chapt. 5, New York: John Wiley.
Johnson, D.S., A Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. (1974). “Worst Case Performance Bounds for Simple One-Dimensional Packing Algorithms,” SIAM Journal on Computing3, 299-326.
Hübscher, Roland and F. Glover. (1994). “Applying Tabu Search with Influential Diversification to Multiprocessor Scheduling,” Computers in Operations Research21, 877-844.
Kämpke, Thomas. (1988). “Simulated Annealing: Use of a New Tool in Bin Packing,” Annals of Operations Research16, 327-332.
Knuth, D. (1973). The Art of Computer Programming: Sorting and Searching. Reading, MA: Addison-Wesley.
Laguna, M. and F. Glover. (1993). “Integrating Target Analysis and Tabu Search for Improved Scheduling Systems,” Expert Systems With Applications6, 287-297.
Løkketangen, A. (1995). “Tabu Search as a Metaheuristic Guide for Combinatorial Optimization Problems,” Dr. Scient. Thesis, Institute for Informatics, University of Bergen, Bergen, Norway.
Morton, T.E. and David W. Pentico. (1993). Heuristic Scheduling Systems. New York, NY: John Wiley & Sons.
Osman, I. and J.P. Kelly (eds.). (1996). Meta-Heuristics. Theory and Applications. Boston: Kluwer Academic Publishers.
Taillard, Eric D. (1994). “Parallel Taboo Search Techniques for the Job Shop Scheduling Problem,” ORSA Journal on Computing6(2), 108-117.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Thesen, A. Design and Evaluation of Tabu Search Algorithms for Multiprocessor Scheduling. Journal of Heuristics 4, 141–160 (1998). https://doi.org/10.1023/A:1009625629722
Issue Date:
DOI: https://doi.org/10.1023/A:1009625629722