Distributionally Robust Resource Planning Under Binomial Demand Intakes
Ben Black, Russell Ainslie, Trivikram Dokka, Christopher Kirkbride

TL;DR
This paper develops distributionally robust resource planning models for uncertain demand, introducing a binomial-based approach and heuristics to improve scalability, with extensive computational validation.
Contribution
It introduces a novel binomial distributionally robust optimization model for resource planning and develops scalable heuristics leveraging binomial properties.
Findings
Binomial model improves decision quality over non-parametric models.
Heuristics significantly reduce computation time.
Inclusion of binomial info enhances robustness of plans.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRisk and Portfolio Optimization · Optimization and Mathematical Programming · Supply Chain and Inventory Management
