Using xQx to model and solve the uncapacitated task allocation problem

This paper illustrates how large instances of the unconstrained task allocation problem can be effectively modeled and efficiently solved as unconstrained quadratic binary programs. Computational experience and a comparison to the state-of-the-art commercial code (CPLEX) illustrate the attractiveness of our approach.

[1]  Fred W. Glover,et al.  A unified modeling and solution framework for combinatorial optimization problems , 2004, OR Spectr..

[2]  Katta G. Murty,et al.  A hybrid genetic/optimization algorithm for a task allocation problem , 1999 .

[3]  George L. Nemhauser,et al.  Scheduling to Minimize Interaction Cost , 1966, Oper. Res..

[4]  Andrea Lodi,et al.  An evolutionary heuristic for quadratic 0-1 programming , 1999, Eur. J. Oper. Res..

[5]  Andrew B. Whinston,et al.  On Optimal Allocation in a Distributed Processing Environment , 1982 .

[6]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[7]  F. Glover,et al.  Adaptive Memory Tabu Search for Binary Quadratic Programs , 1998 .

[8]  Alain Billionnet,et al.  An efficient algorithm for a task allocation problem , 1992, JACM.

[9]  Alain Billionnet,et al.  Minimization of a quadratic pseudo-Boolean function , 1994 .

[10]  Tsan-sheng Hsu,et al.  Task Allocation on a Network of Processors , 2000, IEEE Trans. Computers.

[11]  Wesley W. Chu,et al.  Task Allocation in Distributed Data Processing , 1980, Computer.

[12]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[13]  James C. Bean,et al.  A Genetic Algorithm for the Multiple-Choice Integer Program , 1997, Oper. Res..

[14]  Pierre Hansen,et al.  Constrained Nonlinear 0-1 Programming , 1989 .

[15]  Virginia Mary Lo,et al.  Heuristic Algorithms for Task Assignment in Distributed Systems , 1988, IEEE Trans. Computers.

[16]  P. Chardaire,et al.  A Decomposition Method for Quadratic Zero-One Programming , 1995 .

[17]  Vassilis Zissimopoulos,et al.  On the Task Assignment Problem: Two New Efficient Heuristic Algorithms , 1997, J. Parallel Distributed Comput..

[18]  Vangelis F. Magirou,et al.  An algorithm for the multiprocessor assignment problem , 1989 .

[19]  Bahram Alidaee,et al.  A scatter search approach to unconstrained quadratic binary programs , 1999 .

[20]  Wun-Hwa Chen,et al.  A hybrid heuristic to solve a task allocation problem , 2000, Comput. Oper. Res..

[21]  Endre Boros,et al.  Pseudo-Boolean optimization , 2002, Discret. Appl. Math..

[22]  Pierre Hansen,et al.  State-of-the-Art Survey - Constrained Nonlinear 0-1 Programming , 1993, INFORMS J. Comput..

[23]  Yskandar Hamam,et al.  Assignment of program modules to processors: A simulated annealing approach , 2000, Eur. J. Oper. Res..

[24]  Fred W. Glover,et al.  One-pass heuristics for large-scale unconstrained binary quadratic problems , 2002, Eur. J. Oper. Res..