Authors: Yelin Fu Jianshan Sun K K Lai John W K Leung
Publish Date: 2014/05/29
Volume: 233, Issue: 1, Pages: 123-133
Abstract
We consider two versions of bottleneck or min–max generalized assignment problem BGAP under capacity uncertainty Task–BGAP and Agent–BGAP A robust optimization approach is employed to study this issue The decision maker’s degree of risk aversion and the penalty weighting parameter are incorporated into the objective function A stateoftheart linearization method is introduced to deal with the mathematical model and find the solution scheme Two penalties of weighting parameters that realize the tradeoff between solution robustness and model robustness are obtained Illustrative examples are presented with managerial implications highlighted for decisionmaking considerations
Keywords: