Performance evaluation of a parallel tabu search task scheduling algorithm

Parallel Computing

Volumn 26, Issue 1, 2000, Pages 73-90

  Porto, Stella C S ^a   Kitajima, João Paulo F W ^b   Ribeiro, Celso C ^c  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^c PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SCHEDULING;

GREEDY ALGORITHM; PARALLEL TABU SEARCH;

PARALLEL PROCESSING SYSTEMS;

EID: 0033892938     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(99)00096-4     Document Type: Article

References (22)

1. Barr R.S., Golden B.L., Kelly J.P., Resende M.G.C., Stewart W.R. Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics. 1:1995;9-32.
2. Crainic T.G., Toulouse M., Gendreau M. Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements. OR Spektrum. 17:1995;113-123.
3. Crainic T.G., Toulouse M., Gendreau M. Towards a taxonomy of parallel tabu search algorithms. INFORMS Journal on Computing. 9:1997;61-72.
4. T.G. Crainic and M. Toulouse, Parallel metaheuristics, Research report, Centre de Recherche sur les Transports, Universitè de Montréal, 1997.
5. H. El-Rewini, Partitioning and scheduling, in: A.Y.H. Zomaya (Ed.), Parallel and Distributed Handbook, McGraw-Hill, New York, 1996, pp. 239-273 (Chapter 9).
6. Fiechter C.-N. A parallel tabu search algorithm for large traveling salesman problems. Discrete Applied Mathematics. 51:1994;243-267.
7. Garcia B., Toulouse M. A parallel tabu search for the vehicle routing problem with time windows. Computers and Operations Research. 21:1994;1025-1033.
8. Garey M.R., Johnson D.S. Strong NP-completeness results: motivation, examples and implications. Journal of the ACM. 25:1978;499-508.
9. Garey M.R., Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness. 1979;Freeman, San Francisco.
10. Glover F. Tabu search - Part I. ORSA Journal on Computing. 1:1989;190-206.
11. Glover F. Tabu search - Part II. ORSA Journal on Computing. 2:1990;4-32.
12. F. Glover and M. Laguna, Tabu Search, in: C.R. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 1992, pp. 70-150 (Chapter 3).
13. Glover F., Laguna M. Tabu Search. 1997;Kluwer Academic Publishers, Boston.
14. J.P. Kitajima, B. Plateau, P. Bouvry, D. Trystram, A method and a tool for performance evaluation. A case study: Evaluating mapping strategies, in: Proceedings of the 1994 Cray Users Group Meeting, Tours, 1994.
15. D.A. Menascé, V. Almeida, Cost-performance analysis of heterogeneity in supercomputer architectures, in: Proceedings of the Supercomputing'90 Conference, New York, 1990.
16. D.A. Menascé, S.C.S. Porto, Processor assignment in heterogeneous parallel architectures, in: Proceedings of the IEEE International Parallel Processing Symposium, Beverly Hills, 1992, pp. 186-191.
17. S.C.S. Porto, D.A. Menascé, Processor assignment in heterogeneous message passing parallel architectures, in: Proceedings of the Hawaii International Conference on System Science, Kauai, 1993.
18. Porto S.C.S., Ribeiro C.C. A tabu search approach to task scheduling on heterogeneous processors under precedence constraints. International Journal of High-Speed Computing. 7:1995;45-71.
19. Porto S.C.S., Ribeiro C.C. Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints. Journal of Heuristics. 1:1996;207-233.
20. Reiser M., Lavenberg S.S. Mean value analysis of closed multichain queueing networks. Journal of the ACM. 27:1980;313-322.
21. Taillard E. Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing. 6:1994;108-117.
22. M. Toulouse, T.G. Crainic, M. Gendreau, Communication issues in designing cooperative multi-thread parallel searches, in: I.H. Osman, J.P. Kelly (Eds.), Meta-Heuristics: Theory and Applications, Kluwer Academic Publishers, Dordrecht, 1996, pp. 500-522.