Exact solutions to task allocation problems

Management Science

Volumn 52, Issue 10, 2006, Pages 1634-1646

  Ernst, Andreas ^a   Jiang, Houyuan ^b   Krishnamoorthy, Mohan ^a  

^a CSIRO   (Australia)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Column generation; Integer programs; Task allocation; Task assignment

Indexed keywords

COLUMN GENERATION; TASK ALLOCATION; TASK ASSIGNMENT;

COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; INTEGER PROGRAMMING; PROGRAM PROCESSORS;

PROBLEM SOLVING;

EID: 33749682063     PISSN: 00251909     EISSN: 15265501     Source Type: Journal    
DOI: 10.1287/mnsc.1060.0578     Document Type: Article

References (22)

1. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance. 1998. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46 316-329.
2. Billionnet, A., M. C. Costa, A. Sutter. 1992. An efficient algorithm for a task allocation problem. J. Assoc. Comput. Machinery 39 502-518.
3. Chen, W., C. Lin. 2000. A hybrid heuristic to solve a task allocation problem. Eur. J. Oper. Res. 27 287-303.
4. CPLEX. 2001. CPLEX Reference Manual: Using CPLEX Call Library. CPLEX Optimization Inc., Incline Village, NY.
5. Drezner, Z., H. W. Hamacher. 2002. Facility Location: Applications and Theory. Springer-Verlag, New York.
6. Dutta, A., G. Koehler, A. Whinston. 1982. On optimal allocation in a distributed processing environment. Management Sci. 28 839-853.
7. Gabrielian, A., D. B. Tyler. 1984. Optimal object allocation in distributed systems. Proc. Internat. Conf. Distributed Comput. Systems, IEEE Computer Society, Los Alamitos, CA, 88-95.
8. Hadj-Alouane, A. B., J. C. Bean, K. G. Murty. 1999. A hybrid genetic/optimization algorithm for a task allocation problem. J. Scheduling 2 189-201.
9. Hamam, Y., K. S. Hindi. 2000. Assignment of program modules to processors: A simulated annealing approach. Eur. J. Oper. Res. 122 509-513.
10. Kopidakis, Y., M. Laman, V. Zissimopoulos. 1997. On the task assignment problem: Two new efficient heuristic algorithms. J. Parallel Distributed Comput. 42 21-29.
11. Lo, V. M. 1988. Heuristic algorithms for task assignment in distributed systems. IEEE Trans. Comput. 37 1384-1397.
12. Ma, P. Y. R., E. Y. S. Lee, M. T. Tsuchiya. 1982. A task allocation model for distributed computing systems. IEEE Trans. Comput. C-31 41-47.
13. Magirou, V. F., J. Z. Milis. 1989. An algorithm for the multiprocessor assignment problem. Oper. Res, Lett. 8 351-356.
14. McCreary, C. L., A. A. Khan, J. J. Thompson, M. E. McArdle. 1994. A comparison of heuristics for scheduling DAGs on multi-processors. Proc. 8th Internat. Sympos. Parallel Processing, IEEE Computer Society Press, Washington, D.C., 446-451.
15. Milis, I. 1995. Task assignment in distributed systems using network flow methods. Lecture Notes in Computer Science, Vol. 1120. Springer-Verlag, London, UK, 396-405.
16. Rao, G. J., H. S. Stone, T. C. Hu. 1979. Assignment of tasks in a distributed processor system with limited memory. IEEE Trans. Comput. 28 291-299.
17. Rao, K. N. 1992. Optimal synthesis of microcomputers for GM vehicles. Technical report.
18. Sarje, A. K., G. Sagar. 1991. Heuristic model for task allocation in distributed computer systems. IEE Proc. E-138 313-318.
19. Savelsbergh, M. W. P. 1994. A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45 831-841.
20. Savelsbergh, M. W. P., G. L. Nemhauser. 1996. Functional description of MINTO, a mixed integer optimizer, Version 2.3. Technical report, Georgia Institute of Technology, Atlanta, GA.
21. Sinclair, J. B. 1987. Efficient computation of optimal assignments for distributed tasks. J. Parallel Distributed Comput. 4 342-362.
22. Stone, H. S. 1977. Multiprocessor scheduling with the aid of network flow algorithms. IEEE Trans. Software Engrg. SE-3 85-93.