2002-04-22Buch DOI: 10.18452/8268
Exact solutions to a class of stochastic generalized assignment problems
Vlerk, Maarten H. van der
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment of each job to an agent is decided a priori, and once the demands are known, reassignments can be performed if there are overloaded agents. We construct a convex approximation of the objective function that is sharp at all feasible solutions. We then present three versions of an exact algorithm to solve this problem, based on branch and bound techniques, optimality cuts, and a special purpose lower bound. Numerical results are reported.
Dateien zu dieser Publikation
Is Part Of Series: European journal of operational research : EJOR