Using to model and solve the uncapacitated task allocation problem
β Scribed by Mark Lewis; Bahram Alidaee; Gary Kochenberger
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 172 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
β¦ Synopsis
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-ofthe-art commercial code (CPLEX) illustrate the attractiveness of our approach.
π SIMILAR VOLUMES
The Johnstone-El-Banna model of problem solving is based on workingmemory theory as well as on Pascual-Leone's M-space theory. The operation and validity of the model depends on a number of necessary conditions, such as a simple logical structure, availability and accessibility of the partial steps,