Design and Evaluation of Tabu Search Algorithms for Multiprocessor Scheduling

Journal of Heuristics

Volumn 4, Issue 2, 1998, Pages 141-160

  Thesen, Arne ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Performance evaluation; Scheduling; Tabu search

Indexed keywords

ALGORITHMS; MULTIPROCESSING SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES;

TABU SEARCH;

SCHEDULING;

EID: 0032116468     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009625629722     Document Type: Article

References (18)

1. Anderson, Charles A., Kathryn Fraughnaugh, Mark Parker, and Jennifer Ryan. (1993). "Path Assignment for Call Routing: An Application of Tabu Search," Annals of Operations Research 41, 301-312.
2. Barnes, J.W. and M. Laguna. (1993). "A Tabu Search Experience in Production Scheduling," Annals of Operations Research 41, 141-156.
3. 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.
4. Blazewicz, J., K.E. Ecker E. Pesch, G. Schmidt, and J. Weglarz. (1995). Scheduling Computer and Manufacturing Processes. Berlin: Springer-Verlag.
5. Glover, F. (1986). "Future Paths for Integer Programming and Links to Artificial Intelligence," Computers and Operations Research 13, 533-549.
6. Glover, F. (1995). "Tabu Search Fundamentals and Uses, Revised and Expanded: April 1995." Technical Report, Graduate School of Business, University of Colorado, Bolder, CO.
7. Glover, F. and M. Laguna. (1997). Tabu Search. Boston: Kluwer Academic Publishers.
8. Graham, R.L. (1969). "Bounds for Certain Multiprocessing Anomalities," SIAM J. Appl. Math. 17, 263-269.
9. 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.
10. 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 Computing 3, 299-326.
11. Hübscher, Roland and F. Glover. (1994). "Applying Tabu Search with Influential Diversification to Multiprocessor Scheduling," Computers in Operations Research 21, 877-844.
12. Kämpke, Thomas. (1988). "Simulated Annealing: Use of a New Tool in Bin Packing," Annals of Operations Research 16, 327-332.
13. Knuth, D. (1973). The Art of Computer Programming: Sorting and Searching. Reading, MA: Addison-Wesley.
14. Laguna, M. and F. Glover. (1993). "Integrating Target Analysis and Tabu Search for Improved Scheduling Systems," Expert Systems With Applications 6, 287-297.
15. 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.
16. Morton, T.E. and David W Pentico. (1993). Heuristic Scheduling Systems. New York, NY: John Wiley & Sons.
17. Osman, I. and J.P. Kelly (eds.). (1996). Meta-Heuristics. Theory and Applications. Boston: Kluwer Academic Publishers.
18. Taillard, Eric D. (1994). "Parallel Taboo Search Techniques for the Job Shop Scheduling Problem," ORSA Journal on Computing 6(2), 108-117.