Exact Solutions to Task Allocation Problems

References

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