A hybrid heuristic to solve a task allocation problem

Computers and Operations Research

Volumn 27, Issue 3, 2000, Pages 287-303

  Chen, Wun Hwa ^a   Lin, Chin Shien ^b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b PROVIDENCE UNIVERSITY   (Taiwan)

Author keywords

Noising method; Tabu search; Task allocation

Indexed keywords

MATHEMATICAL ANALYSIS;

METHODOLOGY; MODELING;

ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; RESPONSE TIME (COMPUTER SYSTEMS);

NOISING METHOD; TABU SEARCH; TASK ALLOCATION;

OPERATIONS RESEARCH;

EID: 0034145034     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(99)00045-3     Document Type: Article

References (24)

1. Billionnet A. Costa MC, Sutter A. An efficient algorithm for a task allocation problem. Journal of the Association for Computing Machinery Quarterly 1984;29:147-50.
2. Sinclair JB. Efficient computation of optimal assignments for distributed tasks. Journal of Parallel and Distributed Computing 1987;4:342-62.
3. Dutta A., Koehler G, Whinston A. On optimal allocation in a distributed processing environment. Management Science 1982;28(8):839-53.
4. Lo VM. Heuristic algorithm for task assignment in distributed systems. Proceedings of the International Conference on Distributed Computing Systems. San Francisco, CA, 1984:30-9.
5. Ma PR, Lee EYS, Tsuchiya M. A task allocation model for distributed computing systems. IEEE Transactions on Computers 1982;31(1):41-7.
6. Sarje AK, Sagar G. Heuristic model for task allocation in distributed computer systems. IEE Proceedings. Part E, Computers and Digital Techniques 1991;138:313-8.
7. Shen CC, Tsai WH. A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion. IEEE Transactions on Computers 1985;34:197-203.
8. Price C, Krishnaprasad S. Software allocation models for distributed computing systems. Proceedings of the International Conference on Distributed Computing Systems, San Francisco, CA, 1984;40-8.
9. Hadj-Alouane AB, Bean JC, Murty KG. A hybrid genetic/optimization algorithm for a task allocation problem. Technical Report 93-30, Department of Industrial and Operations Engineering, University of Michigan, 1993.
10. Rao KN. Optimal synthesis of microcomputers for GM vehicles. Technical Report, 1992.
11. Hadj-Alouane AB, Bean JC,. A genetic algorithm for the multiple-choice integer program. Technical Report 92-50, Department of Industrial and Operations Engineering, University of Michigan, 1992.
12. Glover F. Tabu search - Part I. ORSA Journal of Computing 1989;1:190-206.
13. Glover F. Tabu search - Part II. ORSA Journal of Computing 1990;2:4-32.
14. Charon I, Hudry O. The noising method: A new method for combinatorial optimization. Operations Research Letters 1993;14(3):133-7.
15. Stone HS. Multiprocessor scheduling with the aid of network flow algorithms. IEEE Transactions on Software Engineering 1977;3:85-93.
16. Murty KG. Operations Research: Deterministic Optimization Models. Englewood Cliffs, NJ, Prentice-Hall, 1994.
17. Tao L, Zhao Y. Multi-way graph partition by stochastic probe. Computers and Operations Research 1993;20(3):321-47.
18. Gendreau M, Salvail L, Soriano P. Solving the maximum clique problem using a tabu search approach. Discrete Applied Maths 1990.
19. Glover F, Laguna M. Bandwidth packing: A tabu search approach. Presented at the First Workshop on Combinatorial Optimization in Science and Technology, DIMACS Technical Report 91-18, RUTCOR Report 3-91, 1991.
20. Glover F, Hubscher R. Bin packing with tabu search. Technical Report, Graduate School of Business Administration, University of Colorado at Bolder, 1991.
21. Knox J. An Application Of Tabu Search to the Symmetric Travelling Salesman Problem. Ph.D. Thesis, 1988.
22. Skorin-Kapov J. Tabu search applied to the quadratic assignment problem. ORSA Journal of Computing 1990; 2:33-45.
23. Taillard E. Robust taboo search for the quadratic assignment problem. Parallel Computing 1991;17:443-5.
24. Johnson DS. Fast algorithms for bin-packing. Journal of Computer and System Science 1974;8:272-314.