Skip to main content
Log in

A robust optimization solution to bottleneck generalized assignment problem under uncertainty

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Ahmed, S., & Garcia, R. (2003). Dynamic capacity acquisition and assignment under uncertainty. Annals of Operations Research, 124(1–4), 267–283.

    Article  Google Scholar 

  • Deĭneko, V. G., & Woeginger, G. J. (2006). On the robust assignment problem under a fixed number of cost scenarios. Operations Research Letters, 34(2), 175–179.

    Article  Google Scholar 

  • Hwang, J., & Singh, M. R. (1998). Optimal production polices for multi-stage systems with setup costs and uncertain capacities. Management Sciences, 44(9), 1279–1294.

    Article  Google Scholar 

  • Lai, K. K., & Ng, W.-L. (2005). A stochastic approach to hotel revenue optimization. Computers & Operations Research, 32(5), 1059–1072.

    Article  Google Scholar 

  • Laguna, M., Lino, P., Pérez, A., Quintanilla, S., & Valls, V. (2000). Minimizing weighted tardiness of jobs with stochastic interruptions in parallel machines. European Journal of Operational Research, 127(2), 444–457.

    Article  Google Scholar 

  • Mazzola, J. B., & Neebe, A. W. (1988). Bottleneck generalized assignment problem. Engineering Costs and Production Economics, 14(1), 61–65.

    Article  Google Scholar 

  • Mulvey, J. M., Venderbei, R. J., & Zenios, S. A. (1995). Robust optimization of large-scale systems. Operations Research, 43(2), 264–281.

    Article  Google Scholar 

  • Martello, S., & Toth, P. (1995). The bottleneck generalized assignment problem. European Journal of Operational Research, 83(3), 621–638.

    Article  Google Scholar 

  • Shrage, L. E. (1997). Optimization modeling with LINDO. Pacific Grove: Duxbury Press.

    Google Scholar 

  • Snyder, L. V. (2006). Facility location under uncertainty: A review. IIE Transactions, 38(7), 547–564.

    Article  Google Scholar 

  • Yechiali, U. (1968). A stochastic bottleneck assignment problem. Management Science, 14(11), 732–733.

    Article  Google Scholar 

  • Yu, C. S., & Li, H. L. (2000). A robust optimization model for stochastic logistic problems. International Journal of Production Economics, 64(1–3), 385–397.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jianshan Sun.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fu, Y., Sun, J., Lai, K.K. et al. A robust optimization solution to bottleneck generalized assignment problem under uncertainty. Ann Oper Res 233, 123–133 (2015). https://doi.org/10.1007/s10479-014-1631-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-014-1631-5

Keywords

Navigation