Robust Capacity Planning with General Upgrading

References

• Adams C, Fuller D, Weaver K, Ji A, Wolfer A (2022) The beauty battleground: The sprint to win on services. Accessed June 26, 2023, https://www.mckinsey.com/industries/retail/our-insights/the-beauty-battleground-the-sprint-to-win-on-services.Google Scholar
• Akbalik A, Penz B, Rapine C (2015) Capacitated lot sizing problems with inventory bounds. Ann. Oper. Res. 229(1):1–18.Crossref, Google Scholar
• ASDA groceries (2022) About substitutions. Accessed December 2, 2022, https://www.asda.com/groceries/delivery/how-to-shop/.Google Scholar
• Atamtürk A, Küçükyavuz S (2005) Lot sizing with inventory bounds and fixed costs: Polyhedral study and computation. Oper. Res. 53(4):711–730.Link, Google Scholar
• Bassok Y, Anupindi R, Akella R (1999) Single-period multiproduct inventory models with substitution. Oper. Res. 47(4):632–642.Link, Google Scholar
• Bertsimas D, Sim M, Zhang M (2019) Adaptive distributionally robust optimization. Management Sci. 65(2):604–618.Link, Google Scholar
• Bertsimas D, Vinh Doan X, Natarajan K, Teo C-P (2010) Models for minimax stochastic linear optimization problems with risk aversion. Math. Oper. Res. 35(3):580–602.Link, Google Scholar
• Chakravarty IM, Roy JD, Laha RG (1967) Handbook of Methods of Applied Statistics, Wiley Series in Probability and Applied Statistics (John Wiley & Sons, Inc., New York).Google Scholar
• Cheramin M, Cheng J, Jiang R, Pan K (2020) Computationally efficient approximations for distributionally robust optimization. Preprint, submitted May 26, https://optimization-online.org/2020/05/7807/.Google Scholar
• Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3):595–612.Link, Google Scholar
• Esfahani PM, Kuhn D (2018) Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations. Math Programming 171(1–2):115–166.Crossref, Google Scholar
• Feng Q, Li C, Lu M, Shanthikumar JG (2022) Dynamic substitution for selling multiple products under supply and demand uncertainties. Production Oper. Management 31(4):1645–1662.Crossref, Google Scholar
• Fu Q, Sim C-K, Teo C-P (2018) Profit sharing agreements in decentralized supply chains: A distributionally robust approach. Oper. Res. 66(2):500–513.Link, Google Scholar
• Gallego G, Moon I (1993) The distribution free newsboy problem: Review and extensions. J. Oper. Res. Soc. 44(8):825–834.Crossref, Google Scholar
• Gao R, Kleywegt A (2023) Distributionally robust stochastic optimization with Wasserstein distance. Math. Oper. Res. 48(2):603–655.Link, Google Scholar
• Govindarajan A, Sinha A, Uichanco J (2021) Distribution-free inventory risk pooling in a multilocation newsvendor. Management Sci. 67(4):2272–2291.Link, Google Scholar
• Hanasusanto GA, Kuhn D (2018) Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls. Oper. Res. 66(3):849–869.Link, Google Scholar
• Hanasusanto GA, Kuhn D, Wallace SW, Zymler S (2015) Distributionally robust multi-item newsvendor problems with multimodal demand distributions. Math Programming 152(1–2):1–32.Crossref, Google Scholar
• Hao Z, He L, Hu Z, Jiang J (2020) Robust vehicle pre-allocation with uncertain covariates. Production Oper. Management 29(4):955–972.Crossref, Google Scholar
• Hu M, Zhou Y (2022) Dynamic type matching. Manufacturing Service Oper. Management 24(1):125–142.Link, Google Scholar
• Jiang N, Xie W (2023) Distributionally robust two-stage linear programs with Wasserstein distance: Tractable formulations. Pardalos PM, Prokopyev OA, eds. Encyclopedia of Optimization (Springer, Cham, Switzerland), 1–9.Crossref, Google Scholar
• Love SF (1973) Bounded production and inventory models with piecewise concave costs. Management Sci. 20(3):313–318.Link, Google Scholar
• Lu M, Ran L, Shen Z-JM (2015) Reliable facility location design under uncertain correlated disruptions. Manufacturing Service Oper. Management 17(4):445–455.Link, Google Scholar
• Mak H-Y, Rong Y, Zhang J (2015) Appointment scheduling with limited distributional information. Management Sci. 61(2):316–334.Link, Google Scholar
• Natarajan K (2022) Optimization with Marginals and Moments (Dynamic Ideas LLC, Belmont, MA).Google Scholar
• Natarajan K, Sim M, Uichanco J (2018) Asymmetry and ambiguity in newsvendor models. Management Sci. 64(7):3146–3167.Link, Google Scholar
• Netessine S, Dobson G, Shumsky RA (2002) Flexible service capacity: Optimal investment and the impact of demand correlation. Oper. Res. 50(2):375–388.Link, Google Scholar
• Padmanabhan D, Natarajan K, Murthy K (2021) Exploiting partial correlations in distributionally robust optimization. Math Programming 186:209–255.Crossref, Google Scholar
• Pasternack BA, Drezner Z (1991) Optimal inventory policies for substitutable commodities with stochastic demand. Naval Res. Logist. 38(2):221–240.Crossref, Google Scholar
• Popescu I (2007) Robust mean-covariance solutions for stochastic optimization. Oper. Res. 55(1):98–112.Link, Google Scholar
• Poursoltani M, Delage E (2022) Adjustable robust optimization reformulations of two-stage worst-case regret minimization problems. Oper. Res. 70(5):2906–2930.Google Scholar
• Scarf H (1958) A min-max solution of an inventory problem. Arrow KJ, Karlin S, Scarf HE, eds. Studies in the Mathematical Theory of Inventory and Production (Stanford University Press, Stanford, CA), 201–209.Google Scholar
• Shumsky RA, Zhang F (2009) Dynamic capacity management with substitution. Oper. Res. 57(3):671–684.Link, Google Scholar
• Simchi-Levi D, Wei Y (2012) Understanding the performance of the long chain and sparse designs in process flexibility. Oper. Res. 60(5):1125–1141.Link, Google Scholar
• Simchi-Levi D, Wang H, Wei Y (2019) Constraint generation for two-stage robust network flow problems. INFORMS J. Optim. 1(1):49–70.Link, Google Scholar
• Tang J, Shi C, Duenyas I (2024) Online learning and matching for multiproduct systems with general upgrading. Preprint, submitted April 15, http://dx.doi.org/10.2139/ssrn.4781604.Google Scholar
• Wagner HM, Whitin TM (1958) Dynamic version of the economic lot size model. Management Sci. 5(1):89–96.Link, Google Scholar
• Wang X, Zhang J (2015) Process flexibility: A distribution-free bound on the performance of k-chain. Oper. Res. 63(3):555–571.Link, Google Scholar
• Wiesemann W, Kuhn D, Sim M (2014) Distributionally robust convex optimization. Oper. Res. 62(6):1358–1376.Link, Google Scholar
• Wolsey LA (2017) Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds. Math Programming 161:603–609.Crossref, Google Scholar
• Xie W (2020) Tractable reformulations of two-stage distributionally robust linear programs over the type-infinity Wasserstein ball. Oper. Res. Lett. 48(4):513–523.Crossref, Google Scholar
• Yu Y, Chen X, Zhang F (2015) Dynamic capacity management with general upgrading. Oper. Res. 63(6):1372–1389.Link, Google Scholar
• Zeng B, Zhao L (2013) Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 41(5):457–461.Crossref, Google Scholar
• Zhao M, Freeman NK (2019) Robust sourcing from suppliers under ambiguously correlated major disruption risks. Production Oper. Management 28(2):441–456.Crossref, Google Scholar
• Zhao C, Guan Y (2018) Data-driven risk-averse stochastic optimization with Wasserstein metric. Oper. Res. Lett. 46(2):262–267.Crossref, Google Scholar