Addressing capacity uncertainty in resource-constrained assignment problems

Authors:
Berkin Toktas;Joyce W. Yen;Zelda B. Zabinsky
Affiliations:
Industrial Engineering, Box 352650, University of Washington, Seattle, WA, 98195, USA;Industrial Engineering, Box 352650, University of Washington, Seattle, WA, 98195, USA;Industrial Engineering, Box 352650, University of Washington, Seattle, WA, 98195, USA
Venue:
Computers and Operations Research
Year:
2006

Citing 3
Cited 3

Resource-constrained assignment scheduling

Operations Research
Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm

Journal of the ACM (JACM)
Data clustering: a review

ACM Computing Surveys (CSUR)

Particle swarm optimization for two-stage fuzzy generalized assignment problem

ICIC'10 Proceedings of the 6th international conference on Advanced intelligent computing theories and applications: intelligent computing
Uncertain personal advertisement allocation for Mobile TV

Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
Solving fuzzy multiple objective generalized assignment problems directly via bees algorithm and fuzzy ranking

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

Resource-constrained assignment problems typically assume capacities are known. We focus on the situation when capacities are uncertain. In addition to the well-known generalized assignment problem (GAP) and the assignment problem with side-constraints (APSC), we discuss two other resource-constrained generalizations of the assignment problem. We identify two alternative approaches to utilize deterministic solution strategies while addressing capacity uncertainty, and illustrate how these approaches can be applied to a specific generalization. We also report the performance of these alternatives on a number of random test problems.