Using x Qx to model and solve the uncapacitated task allocation problem

Operations Research Letters

Volumn 33, Issue 2, 2005, Pages 176-182

  Lewis, Mark ^a,c   Alidaee, Bahram ^a   Kochenberger, Gary ^b  

^a UNIVERSITY OF MISSISSIPPI   (United States)

^b UNIVERSITY OF COLORADO   (United States)

^c Holman Hall ^*  (United States)

Author keywords

Integer programming; Metaheuristics; Task allocation

Indexed keywords

HEURISTIC METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; SCHEDULING; SERVERS;

METAHEURISTICS; TASK ALLOCATION; UNCONSTRAINED QUADRATIC BINARY PROGRAM (UQP);

PROBLEM SOLVING;

EID: 9644275654     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.04.014     Document Type: Article

References (25)

1. M. Amini, B. Alidaee, G. Kochenberger, A scatter search approach to unconstrained quadratic binary programs. New Methods in Optimization, Cone, Dorigo, and Glover, McGraw-Hill, New York, 1999.
2. A. Billionnet, M.C. Costa, A. Sutter, An efficient algorithm for a task allocation problem, J. Assoc. Comput. Mach. 39 (3) (1992) 502-518.
3. A. Billionnet, A. Sutter, Minimization of a quadratic pseudo-boolean function, European J. Oper. Res. 78 (1994) 106-115.
4. E. Boros, P. Hammer, Pseudo-boolean optimization, Discrete Appl. Math. 123 (1-3) (2002) 155-225.
5. R. Carlson, G. Nemhauser, Scheduling to minimize interaction cost, Oper. Res. 14 (1966) 52-58.
6. P. Chardaire, A. Sutter, A decomposition method for quadratic zero-one programming, Management Sci. 41 (4) (1994) 704 -712.
7. W. Chen, C. Lin, A hybrid heuristic to solve a task allocation problem, Comput. Oper. Res. 27 (2000) 287-303.
8. W. Chu, L. Holloway, M. Lan, K. Efe, Task allocation in distributed data processing, IEEE Comput. 13 (11) (1980) 57-69.
9. A. Dutta, G. Kochler, A. Whinston, Optimal allocation in a distributed processing environment, Management Sci. Duxbury, 28, 1982.
10. F. Glover, B. Alidaee, C. Rego, G. Kochenberger, One-pass heuristics for large-scale unconstrained binary quadratic programs, European J. Oper. Res. 137 (2002) 272-287.
11. F. Glover, G.A. Kochenberger, B. Alidaee, Adaptive memory tabu search for binary quadratic programs, Management Sci. 44 (3) (1998) 336-345.
12. F. Glover, G. Kochenberger, B. Alidaee, M.M. Amini, Tabu with search critical event memory: an enhanced application for binary quadratic programs, in: S. Voss, S. Martello, I. Osman, C. Roucairol (Eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, Boston, 1999.
13. A.B. Hadj-Alounae, J. Bean, A genetic algorithm for the multiple-choice integer program, Oper. Res. 45 (1) (1997) 92-101.
14. A.B. Hadj-Alounae, J. Bian, K. Murty, A hybrid genetic/optimization algorithm for a task allocation problem, J. Scheduling 2 (1999) 189-201.
15. Y. Hamam, K. Hindi, Assignment of program modules to processors: a simulated annealing approach, European J. Oper. Res. 122 (2000) 509-513.
16. P. Hammer, S. Rudeanu, Boolean Methods in Operations Research and Related Areas, Springer, Berlin, Heidelberg, New York, 1968.
17. P. Hansen, B. Jaumard, V. Mathon, Constrained nonlinear 0-1 programming, INFORMS J. Comput. 5 (2) (1993) 97-119.
18. T. Hsu, J. Lee, D. Lopez, W. Royce, Task allocation on a network of processors, IEEE Trans. Comput. 49 (12) (2000) 1339-1353.
19. G. Kochenberger, F. Glover, B. Alidaee, C. Rego, An unconstrained quadratic binary programming approach to modeling and solving combinatorial optimization problems, University of Colorado Working Paper, 2002.
20. G. Kochenberger, F. Glover, B. Alidaee, C. Rego, A unified modeling and solution framework for combinatorial optimization problems, OR-Spectrum 26 (2) (2004) 237-250.
21. Y. Kopidakis, M. Lamari, V. Zissimopoulos, J. Parallel Distributed Comput. 42 (1997) 21-29.
22. V. Lo, Heuristic algorithms for task assignment in distributed systems, IEEE Trans. Comput. 37 (11) (1988) 1384-1397.
23. A. Lodi, K. Allemand, T.M. Liebling, An evolutionary heuristic for quadratic 0-1 programming, European J. Oper. Res. 119 (1999) 662-670.
24. F. Magirou, J.Z. Mills, An algorithm for the multiprocessor assignment problem, Oper. Res. Lett. 8 (1989) 351-356.
25. H. Stone, Multiprocessor scheduling with the aid of network flow algorithms, IEEE Trans. Software Engrg. SE-3 (1977) 85-93.