A robust optimization solution to bottleneck generalized assignment problem under uncertainty
Yelin Fu (),
Jianshan Sun (),
K. Lai () and
John Leung ()
Annals of Operations Research, 2015, vol. 233, issue 1, 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 state-of-the-art linearization method is introduced to deal with the mathematical model and find the solution scheme. Two penalties of weighting parameters that realize the trade-off between solution robustness and model robustness are obtained. Illustrative examples are presented with managerial implications highlighted for decision-making considerations. Copyright Springer Science+Business Media New York 2015
Keywords: Robust optimization; Bottleneck; Assignment; Stochastic programming (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)
Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-014-1631-5 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:233:y:2015:i:1:p:123-133:10.1007/s10479-014-1631-5
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1007/s10479-014-1631-5
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().