678
Views
16
CrossRef citations to date
0
Altmetric
Articles

Task assignment under uncertainty: stochastic programming and robust optimisation approaches

Pages 1487-1502 | Received 12 Feb 2014, Accepted 28 Jul 2014, Published online: 26 Aug 2014

References

  • Albareda-Sambola, M., M. H. Van der Vlerk, and E. Fernández. 2006. “Exact Solutions to a Class of Stochastic Generalized Assignment Problems.” European Journal of Operational Research 173 (2): 465–487.10.1016/j.ejor.2005.01.035
  • Ang, M., Y. Lim, and M. Sim. 2012. “Robust Storage Assignment in Unit-load Warehouses.” Management Science 58: 2114–2130.10.1287/mnsc.1120.1543
  • Assavapokee, T., M. J. Realff, and J. C. Ammons. 2008. “Min–Max Regret Robust Optimization Approach on Interval Data Uncertainty.” Journal of Optimization Theory and Applications 137: 297–316.10.1007/s10957-007-9334-6
  • Avriel, M., and A. C. Williams. 1970. “The Value of Information and Stochastic Programming.” Operations Research 18 (5): 947–954.10.1287/opre.18.5.947
  • Beck, A., and A. Ben-Tal. 2009. “Duality in Robust Optimization: Primal Worst Equals Dual Best.” Operations Research Letters 37: 1–6.10.1016/j.orl.2008.09.010
  • Ben-Tal, A., and A. Nemirovski. 2008. “Selected Topics in Robust Convex Optimization.” Mathematical Programming 112: 125–158.
  • Ben-Tal, A., B. D. Chung, S. R. Mandala, and T. Yao. 2011. “Robust Optimization for Emergency Logistics Planning: Risk Mitigation in Humanitarian Relief Supply Chains.” Transportation Research Part B 45: 1177–1189.10.1016/j.trb.2010.09.002
  • Bertsimas, D., and V. Goyal. 2010. “On the Power of Robust Solutions in Two-stage Stochastic and Adaptive Optimization Problems.” Mathematics of Operations Research 35: 284–305.10.1287/moor.1090.0440
  • Bertsimas, D., and M. Sim. 2004. “Price of Robustness.” Operations Research 52: 35–53.10.1287/opre.1030.0065
  • Bertsimas, D., D. B. Brown, and C. Caramanis. 2011. “Theory and Applications of Robust Optimization.” SIAM Review 53: 464–501.10.1137/080734510
  • Carello, G., and E. Lanzarone. 2014. “A Cardinality-Constrained Robust Model for the Assignment Problem in Home Care Services.” European Journal of Operational Research 236: 748–762.10.1016/j.ejor.2014.01.009
  • Cattrysse, D. G., and L. N. Van Wassenhove. 1992. “A Survey of Algorithms for the Generalized Assignment Problem.” European Journal of Operational Research 60 (3): 260–272.10.1016/0377-2217(92)90077-M
  • Chen, X., M. Sim, and P. Sun. 2007. “A Robust Optimization Perspective on Stochastic Programming.” Operations Research 55: 1058–1071.10.1287/opre.1070.0441
  • Cheung, R. K., D. D. Hang, and N. Shi. 2005. “A Labeling Method for Dynamic Driver-task Assignment with Uncertain Task Durations.” Operations Research Letters 33 (4): 411–420.10.1016/j.orl.2004.08.006
  • Gabrel, V., and C. Murat. 2010. “Robustness and Duality in Linear Programming.” Journal of the Operational Research Society 61: 1288–1296.
  • Gabrel, V., C. Murat, and A. Thiele. 2014. “Recent Advances in Robust Optimization: An Overview.” European Journal of Operational Research 235: 471–483.10.1016/j.ejor.2013.09.036
  • Gorissen, B., A. Ben-Tal, H. Blanc, and D. Den Hertog. 2012. A New Method for Deriving Robust and Globalized Robust Solutions of Uncertain Linear Conic Optimization Problems Having General Convex Uncertainty Sets. Technical report, Tilburg University.
  • Gregory, C., K. Darby-Dowman, and G. Mitra. 2011. “Robust Optimization and Portfolio Selection: The Cost of Robustness.” European Journal of Operational Research 212 (2): 417–428.10.1016/j.ejor.2011.02.015
  • Haddadi, S., and H. Ouzia. 2004. “Effective Algorithm and Heuristic for the Generalized Assignment Problem.” European Journal of Operational Research 153 (1): 184–190.10.1016/S0377-2217(02)00710-5
  • Herroelen, W., and R. Leus. 2005. “Project Scheduling under Uncertainty: Survey and Research Potentials.” European Journal of Operational Research 165: 289–306.10.1016/j.ejor.2004.04.002
  • Kanyalkar, A. P., and G. K. Adil. 2010. “A Robust Optimisation Model for Aggregate and Detailed Planning of a Multi-Site Procurement-production-distribution System.” International Journal of Production Research 48: 635–656.10.1080/00207540802471272
  • Kirkizlar, E., S. Andradottir, and H. Ayhan. 2010. “Robustness of Efficient Server Assignment Policies to Service Time Distributions in Finite-buffered Lines.” Naval Research Logistics 57: 563–582.10.1002/nav.v57:6
  • Krokhmal, P. A., and P. M. Pardalos. 2009. “Random Assignment Problems.” European Journal of Operational Research 194 (1): 1–17.10.1016/j.ejor.2007.11.062
  • Kuhn, H. W. 1955. “The Hungarian Method for the Assignment Problem.” Naval Research Logistics Quarterly 2 (1–2): 83–97.10.1002/(ISSN)1931-9193
  • Lamiri, M., X. Xie, A. Dolgui, and F. Grimaud. 2008. “A Stochastic Model for Operating Room Planning with Elective and Emergency Demand for Surgery.” European Journal of Operational Research 185: 1026–1037.10.1016/j.ejor.2006.02.057
  • Lin, Y.-K., and C.-T. Yeh. 2012. “Determining the Optimal Double-Component Assignment for a Stochastic Computer Network.” Omega 40 (1): 120–130.
  • Minoux, M. 2011. “On 2-Stage Robust LP with RHS Uncertainty: Complexity Results and Applications.” Journal of Global Optimization 49: 521–537.10.1007/s10898-010-9645-2
  • Narciso, M. G., and L. A. Lorena. 1999. “Lagrangean/Surrogate Relaxation for Generalized Assignment Problems.” European Journal of Operational Research 114 (1): 165–177.10.1016/S0377-2217(98)00038-1
  • Ng, T. S., Y. Sun, and J. Fowler. 2010. “Semiconductor Lot Allocation Using Robust Optimization.” European Journal of Operational Research 205: 557–570.10.1016/j.ejor.2010.01.021
  • Ouorou, A. 2013. “Tractable Approximations to a Robust Capacity Assignment Model in Telecommunications under Demand Uncertainty.” Computers & Operations Research 40: 318–327.
  • Shapiro, A. 2011. “A Dynamic Programming Approach to Adjustable Robust Optimization.” Operations Research Letters 39: 83–87.10.1016/j.orl.2011.01.001
  • Votaw, D. F., Orden, A. 1952. “The Personnel Assignment Problem.” Symposium on Linear Inequalities and Programming, SCOOP 10, US Air Force, Washington, DC, 155–163.
  • Woodcock, A. J., and J. M. Wilson. 2010. “A Hybrid Tabu Search/Branch & Bound Approach to Solving the Generalized Assignment Problem.” European Journal of Operational Research 207 (2): 566–578.10.1016/j.ejor.2010.05.007
  • Wu, Y. 2006. “Robust Optimization Applied to Uncertain Production Loading Problems with Import Quota Limits under the Global Supply Chain Management Environment.” International Journal of Production Research 44: 849–882.10.1080/00207540500285040
  • Yan, S., and C.-H. Tang. 2007. “A Heuristic Approach for Airport Gate Assignments for Stochastic Flight Delays.” European Journal of Operational Research 180 (2): 547–567.10.1016/j.ejor.2006.05.002
  • Zhang, Z., and J. Daigle. 2012. “Analysis of Job Assignment with Batch Arrivals among Heterogeneous Servers.” European Journal of Operational Research 217 (1): 149–161.10.1016/j.ejor.2011.09.001
  • Zhen, L., L. H. Lee, and E. P. Chew. 2011. “A Decision Model for Berth Allocation under Uncertainty.” European Journal of Operational Research 212: 54–68.10.1016/j.ejor.2011.01.021

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.