IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v306y2023i1p227-242.html
   My bibliography  Save this article

Distributionally robust resource planning under binomial demand intakes

Author

Listed:
  • Black, Ben
  • Ainslie, Russell
  • Dokka, Trivikram
  • Kirkbride, Christopher

Abstract

In this paper, we consider a distributionally robust resource planning model inspired by a real-world service industry problem. In this problem, there is a mixture of known demand and uncertain future demand. Prior to having full knowledge of the demand, we must decide upon how many jobs we plan to complete on each day in the planning horizon. Any jobs that are not completed by the end of their due date incur a cost and become due the following day. We present two distributionally robust optimisation (DRO) models for this problem. The first is a non-parametric model with a phi-divergence based ambiguity set. The second is a parametric model, where we treat the number of uncertain jobs due on each day as a binomial random variable with an unknown success probability. We reformulate the parametric model as a mixed integer program and find that it scales poorly with the sizes of the ambiguity and uncertainty sets. Hence, we make use of theoretical properties of the binomial distribution to derive fast heuristics based on dimension reduction. One is based on cutting surface algorithms commonly seen in the DRO literature. The other operates on a small subset of the uncertainty set for the future demand. We perform extensive computational experiments to establish the performance of our algorithms. We compare decisions from the parametric and non-parametric models, to assess the benefit of including the binomial information.

Suggested Citation

  • Black, Ben & Ainslie, Russell & Dokka, Trivikram & Kirkbride, Christopher, 2023. "Distributionally robust resource planning under binomial demand intakes," European Journal of Operational Research, Elsevier, vol. 306(1), pages 227-242.
    • Handle: RePEc:eee:ejores:v:306:y:2023:i:1:p:227-242
    DOI: 10.1016/j.ejor.2022.08.019
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221722006622
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2022.08.019?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sanjay Mehrotra & David Papp, 2013. "A cutting surface algorithm for semi-infinite convex programming with an application to moment robust optimization," Papers 1306.3437, arXiv.org, revised Aug 2014.
    2. Holte, Matias & Mannino, Carlo, 2013. "The implementor/adversary algorithm for the cyclic and robust scheduling problem in health-care," European Journal of Operational Research, Elsevier, vol. 226(3), pages 551-559.
    3. Mallik Angalakudati & Siddharth Balwani & Jorge Calzada & Bikram Chatterjee & Georgia Perakis & Nicolas Raad & Joline Uichanco, 2014. "Business Analytics for Flexible Resource Allocation Under Random Emergencies," Management Science, INFORMS, vol. 60(6), pages 1552-1573, June.
    4. Rossi, Roberto & Prestwich, Steven & Tarim, S. Armagan & Hnich, Brahim, 2014. "Confidence-based optimisation for the newsvendor problem under binomial, Poisson and exponential demand," European Journal of Operational Research, Elsevier, vol. 239(3), pages 674-684.
    5. Robert B. Fetter, 1961. "A Linear Programming Model for Long Range Capacity Planning," Management Science, INFORMS, vol. 7(4), pages 372-378, July.
    6. Aharon Ben-Tal & Dick den Hertog & Anja De Waegenaere & Bertrand Melenberg & Gijs Rennen, 2013. "Robust Solutions of Optimization Problems Affected by Uncertain Probabilities," Management Science, INFORMS, vol. 59(2), pages 341-357, April.
    7. Fanwen Meng & Jin Qi & Meilin Zhang & James Ang & Singfat Chu & Melvyn Sim, 2015. "A Robust Optimization Model for Managing Elective Admission in a Public Hospital," Operations Research, INFORMS, vol. 63(6), pages 1452-1467, December.
    8. Charles C. Holt & Franco Modigliani & Herbert A. Simon, 1955. "A Linear Decision Rule for Production and Employment Scheduling," Management Science, INFORMS, vol. 2(1), pages 1-30, October.
    9. S. Liao & Christian van Delft & J.-P. Vial, 2013. "Distributionally robust workforce scheduling in call centres with uncertain arrival rates," Post-Print hal-01069123, HAL.
    10. Laurent El Ghaoui & Maksim Oks & Francois Oustry, 2003. "Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach," Operations Research, INFORMS, vol. 51(4), pages 543-556, August.
    11. Dori Hulst & Dick Hertog & Wim Nuijten, 2017. "Robust shift generation in workforce planning," Computational Management Science, Springer, vol. 14(1), pages 115-134, January.
    12. Lotfi, Somayyeh & Zenios, Stavros A., 2018. "Robust VaR and CVaR optimization under joint ambiguity in distributions, means, and covariances," European Journal of Operational Research, Elsevier, vol. 269(2), pages 556-576.
    13. Fred Hanssmann & Sidney W. Hess, 1960. "A Linear Programming Approach to Production and Employment Scheduling," Management Science, INFORMS, vol. 0(1), pages 46-51, January.
    14. Luo, Fengqiao & Mehrotra, Sanjay, 2019. "Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models," European Journal of Operational Research, Elsevier, vol. 278(1), pages 20-35.
    15. Georg Pflug & David Wozabal, 2007. "Ambiguity in portfolio selection," Quantitative Finance, Taylor & Francis Journals, vol. 7(4), pages 435-442.
    16. Michael Samudra & Carla Van Riet & Erik Demeulemeester & Brecht Cardoen & Nancy Vansteenkiste & Frank E. Rademakers, 2016. "Scheduling operating rooms: achievements, challenges and pitfalls," Journal of Scheduling, Springer, vol. 19(5), pages 493-525, October.
    17. İhsan Yanıkoğlu & Dick den Hertog, 2013. "Safe Approximations of Ambiguous Chance Constraints Using Historical Data," INFORMS Journal on Computing, INFORMS, vol. 25(4), pages 666-681, November.
    18. Henry Lam, 2019. "Recovering Best Statistical Guarantees via the Empirical Divergence-Based Distributionally Robust Optimization," Operations Research, INFORMS, vol. 67(4), pages 1090-1105, July.
    19. Bastian, Nathaniel D. & Lunday, Brian J. & Fisher, Christopher B. & Hall, Andrew O., 2020. "Models and methods for workforce planning under uncertainty: Optimizing U.S. Army cyber branch readiness and manning," Omega, Elsevier, vol. 92(C).
    20. X Zhu & H D Sherali, 2009. "Two-stage workforce planning under demand fluctuations and uncertainty," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 94-103, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. L. Jeff Hong & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
    2. Wang, Yu & Zhang, Yu & Tang, Jiafu, 2019. "A distributionally robust optimization approach for surgery block allocation," European Journal of Operational Research, Elsevier, vol. 273(2), pages 740-753.
    3. Bart P. G. Van Parys & Peyman Mohajerin Esfahani & Daniel Kuhn, 2021. "From Data to Decisions: Distributionally Robust Optimization Is Optimal," Management Science, INFORMS, vol. 67(6), pages 3387-3402, June.
    4. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    5. Shubhechyya Ghosal & Wolfram Wiesemann, 2020. "The Distributionally Robust Chance-Constrained Vehicle Routing Problem," Operations Research, INFORMS, vol. 68(3), pages 716-732, May.
    6. Luo, Fengqiao & Mehrotra, Sanjay, 2019. "Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models," European Journal of Operational Research, Elsevier, vol. 278(1), pages 20-35.
    7. Shanshan Wang & Erick Delage, 2024. "A Column Generation Scheme for Distributionally Robust Multi-Item Newsvendor Problems," INFORMS Journal on Computing, INFORMS, vol. 36(3), pages 849-867, May.
    8. Guanglin Xu & Samuel Burer, 2018. "A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming," Computational Management Science, Springer, vol. 15(1), pages 111-134, January.
    9. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    10. Maximilian Blesch & Philipp Eisenhauer, 2021. "Robust decision-making under risk and ambiguity," Papers 2104.12573, arXiv.org, revised Oct 2021.
    11. Dey, Shibshankar & Kim, Cheolmin & Mehrotra, Sanjay, 2024. "An algorithm for stochastic convex-concave fractional programs with applications to production efficiency and equitable resource allocation," European Journal of Operational Research, Elsevier, vol. 315(3), pages 980-990.
    12. Ran Ji & Miguel A. Lejeune, 2021. "Data-Driven Optimization of Reward-Risk Ratio Measures," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1120-1137, July.
    13. Zhi Chen & Melvyn Sim & Peng Xiong, 2020. "Robust Stochastic Optimization Made Easy with RSOME," Management Science, INFORMS, vol. 66(8), pages 3329-3339, August.
    14. Meysam Cheramin & Jianqiang Cheng & Ruiwei Jiang & Kai Pan, 2022. "Computationally Efficient Approximations for Distributionally Robust Optimization Under Moment and Wasserstein Ambiguity," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1768-1794, May.
    15. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    16. Martin Branda & Max Bucher & Michal Červinka & Alexandra Schwartz, 2018. "Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization," Computational Optimization and Applications, Springer, vol. 70(2), pages 503-530, June.
    17. Haolin Ruan & Zhi Chen & Chin Pang Ho, 2023. "Adjustable Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1002-1023, September.
    18. Maximilian Blesch & Philipp Eisenhauer, 2023. "Robust Decision-Making under Risk and Ambiguity," Rationality and Competition Discussion Paper Series 463, CRC TRR 190 Rationality and Competition.
    19. Tohidi, Mohammad & Kazemi Zanjani, Masoumeh & Contreras, Ivan, 2021. "A physician planning framework for polyclinics under uncertainty," Omega, Elsevier, vol. 101(C).
    20. Somayyeh Lotfi & Stavros A. Zenios, 2024. "Robust mean-to-CVaR optimization under ambiguity in distributions means and covariance," Review of Managerial Science, Springer, vol. 18(7), pages 2115-2140, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:306:y:2023:i:1:p:227-242. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.