Learning in Lost-Sales Inventory Systems with Stochastic Lead Times and Random Supplies

Published Online:https://doi.org/10.1287/mnsc.2023.04203

References

  • Agrawal S, Jia R (2022) Learning in structured MDPs with convex cost functions: Improved regret bounds for inventory management. Oper. Res. 70(3):1646–1664.LinkGoogle Scholar
  • Agarwal A, Foster DP, Hsu D, Kakade SM, Rakhlin A (2013) Stochastic convex optimization with bandit feedback. SIAM J. Optim. 23(1):213–240.CrossrefGoogle Scholar
  • Amazon (2023) Build supply chain resilience in the face of uncertainty. Amazon Bus. Accessed August 11, 2026, https://business.amazon.com/en/discover-more/blog/build-supply-chain-resilience-in-the-face-of-uncertainty.Google Scholar
  • Avriel M, Wilde DJ (1966) Optimality proof for the symmetric Fibonacci search technique. Fibonacci Quart. 4(3):265–269.CrossrefGoogle Scholar
  • Bai X, Chen X, Li M, Stolyar A (2026) Asymptotic optimality of semi-open-loop policies in lost-sales inventory models with stochastic lead times. Management Sci. Forthcoming. Google Scholar
  • Bai X, Chen X, Li M, Stolyar A (2023) Asymptotic optimality of semi-open-loop policies in Markov decision processes with large lead times. Oper. Res. 71(6):2061–2077.LinkGoogle Scholar
  • Bollapragada S, Morton TE (1999) Myopic heuristics for the random yield problem. Oper. Res. 47(5):713–722.LinkGoogle Scholar
  • Bu J, Gong X, Yao D (2020) Constant-order policies for lost-sales inventory models with random supply functions: Asymptotics and heuristic. Oper. Res. 68(4):1063–1073.LinkGoogle Scholar
  • Cachon GP (2003) Supply chain coordination with contracts. Handbooks in Operations Research and Management Science, vol. 11 (North-Holland, Amsterdam), 227–339.CrossrefGoogle Scholar
  • Chen X, Gao X (2019) Stochastic optimization with decisions truncated by positively dependent random variables. Oper. Res. 67(5):1321–1327.LinkGoogle Scholar
  • Chen X, Gao X, Hu Z (2015) A new approach to two-location joint inventory and transshipment control via l♯-convexity. Oper. Res. Lett. 43(1):65–68.CrossrefGoogle Scholar
  • Chen X, Gao X, Pang Z (2018) Preservation of structural properties in optimization with decisions truncated by random variables and its applications. Oper. Res. 66(2):340–357.LinkGoogle Scholar
  • Chen X, Hu Y, Zhao M (2026a) Landscape of policy optimization for finite horizon MDPs with general state and action. Preprint, submitted September 25, https://arxiv.org/abs/2409.17138.Google Scholar
  • Chen X, Hong G, Liu Y (2026b) Online learning and optimization for queues with unknown arrival rate and service distribution. Oper. Res. 74(4):2053–2074.Google Scholar
  • Chen X, Liu Y, Hong G (2024) An online learning approach to dynamic pricing and capacity sizing in service systems. Oper. Res. 72(6):2677–2697.LinkGoogle Scholar
  • Chen W, Shi C, Duenyas I (2020) Optimal learning algorithms for stochastic inventory systems with random capacities. Production Oper. Management 29(7):1624–1649.CrossrefGoogle Scholar
  • Chen X, Xin L, Zhao M (2025a) Hidden convexity in queueing models. Preprint, submitted November 6, https://arxiv.org/abs/2511.03955.Google Scholar
  • Chen X, He N, Hu Y, Ye Z (2025b) Efficient algorithms for a class of stochastic hidden convex optimization and Its applications in network revenue management. Oper. Res. 73(2):704–719.Google Scholar
  • Chen B, Jiang J, Zhang J, Zhou Z (2024) Learning to order for inventory systems with lost sales and uncertain supplies. Management Sci. 70(12):8631–8646.LinkGoogle Scholar
  • Ciarallo FW, Akella R, Morton TE (1994) A periodic review, production planning model with uncertain capacity and uncertain demand—Optimality of extended myopic policies. Management Sci. 40(3):320–332.LinkGoogle Scholar
  • Dada M, Petruzzi NC, Schwarz LB (2007) A newsvendor’s procurement problem when suppliers are unreliable. Manufacturing Service Oper. Management 9(1):9–32.LinkGoogle Scholar
  • Feng Q (2010) Integrating dynamic pricing and replenishment decisions under supply capacity uncertainty. Management Sci. 56(12):2154–2172.LinkGoogle Scholar
  • Feng Q, Shanthikumar JG (2018) Supply and demand functions in inventory models. Oper. Res. 66(1):77–91.LinkGoogle Scholar
  • Feng Q, Shanthikumar JG (2023) The framework of parametric and nonparametric operational data analytics. Production Oper. Management 32(9):2685–2703.CrossrefGoogle Scholar
  • Feng Q, Li L, Shanthikumar JG (2026) Transfer learning, cross learning and co-learning across newsvendor systems with operational data analytics (ODA). Management Sci., ePub ahead of print May 7, https://doi.org/10.1287/mnsc.2023.03688.Google Scholar
  • Feng Q, Shanthikumar JG, Wu J (2025) Contextual data-integrated newsvendor solution with operational data analytics (ODA). Management Sci. 71(11):9384–9403.LinkGoogle Scholar
  • Gao X, Zhang H (2022a) An efficient learning framework for multiproduct inventory systems with customer choices. Production Oper. Management 31(6):2492–2516.CrossrefGoogle Scholar
  • Gao X, Zhang H (2022b) Inventory control with censored demand. Chen X, Jasin S, Shi C, eds. The Elements of Joint Learning and Optimization in Operations Management, Springer Series in Supply Chain Management, vol. 18 (Springer, Cham, Switzerland), 273–303.CrossrefGoogle Scholar
  • Gong XY, Simchi-Levi D (2023) Bandits atop reinforcement learning: Tackling online inventory models with cyclic demands. Management Sci. 70(9):6139–6157.Google Scholar
  • Hadley G, Whitin TM (1963) Analysis of Inventory Systems (Prentice-Hall, Englewood Cliffs, NJ).Google Scholar
  • Hsu A, Bassok Y (1999) Random yield and random demand in a production system with downward substitution. Oper. Res. 47(2):277–290.LinkGoogle Scholar
  • Huh WT, Nagarajan M (2010) Linear inflation rules for the random yield problem: Analysis and computations. Oper. Res. 58(1):244–251.LinkGoogle Scholar
  • Huh WT, Rusmevichientong P (2009) A nonparametric asymptotic analysis of inventory planning with censored demand. Math. Oper. Res. 34(1):103–123.LinkGoogle Scholar
  • Huh WT, Janakiraman G, Muckstadt JA, Rusmevichientong P (2009a) An adaptive algorithm for finding the optimal base-stock policy in lost sales inventory systems with censored demand. Math. Oper. Res. 34(2):397–416.LinkGoogle Scholar
  • Huh WT, Janakiraman G, Muckstadt JA, Rusmevichientong P (2009b) Asymptotic optimality of order-up-to policies in lost sales inventory systems. Management Sci. 55(3):404–420.LinkGoogle Scholar
  • Janakiraman G, Roundy RO (2004) Lost-sales problems with stochastic lead times: Convexity results for base-stock policies. Oper. Res. 52(5):795–803.LinkGoogle Scholar
  • Kaplan RS (1970) A dynamic inventory model with stochastic lead times. Management Sci. 16(7):491–507.LinkGoogle Scholar
  • Keskin NB, Min X, Song JSJ (2026) The nonstationary newsvendor: Data-driven nonparametric learning. Management Sci. Forthcoming.Google Scholar
  • Levi R, Perakis G, Uichanco J (2015) The data-driven newsvendor problem: New bounds and insights. Oper. Res. 63(6):1294–1306.LinkGoogle Scholar
  • Lin M, Huh WT, Krishnan H, Uichanco J (2022) Data-driven newsvendor problem: Performance of the sample average approximation. Oper. Res. 70(4):1996–2012.LinkGoogle Scholar
  • Loynes RM (1962) The stability of a queue with non-independent inter-arrival and service times. Math. Proc. Cambridge Philos. Soc. 58(3):497–520.CrossrefGoogle Scholar
  • Lyu C, Zhang H, Xin L (2024) UCB-type learning algorithms with Kaplan-Meier estimator for lost-sales inventory models with lead times. Oper. Res. 72(4):1317–1332.Google Scholar
  • Lyu J, Xie J, Yuan S, Zhou Y (2024) A minibatch stochastic gradient descent-based learning metapolicy for inventory systems with myopic optimal policy. Management Sci. 71(7):5572–5588.LinkGoogle Scholar
  • Nahmias S (1979) Simple approximations for a variety of dynamic leadtime lost-sales inventory models. Oper. Res. 27(5):904–924.LinkGoogle Scholar
  • Qin H, Simchi-Levi D, Wang L (2022) Data-driven approximation schemes for joint pricing and inventory control models. Management Sci. 68(9):6591–6609.LinkGoogle Scholar
  • Qin H, Simchi-Levi D, Zhu R (2023) Sailing through the dark: Provably sample-efficient inventory control. Preprint, submitted December 8, https://doi.org/10.2139/ssrn.4652347.Google Scholar
  • Shaked M, Shanthikumar JG (2007) Stochastic Orders, Springer Series in Statistics (Springer, New York).CrossrefGoogle Scholar
  • Shamir O (2013) On the complexity of bandit and derivative-free stochastic convex optimization. Proc. 26th Annual Conf. Learn. Theory (PMLR, New York), 3–24.Google Scholar
  • Shi C, Chen W, Duenyas I (2016) Nonparametric data-driven algorithms for multiproduct inventory systems with censored demand. Oper. Res. 64(2):362–370.LinkGoogle Scholar
  • Snyder LV, Shen ZJM (2019) Fundamentals of Supply Chain Theory (John Wiley & Sons, Hoboken, NJ).CrossrefGoogle Scholar
  • Song JS, Zipkin PH (1996a) Inventory control with information about supply conditions. Management Sci. 42(10):1409–1419.LinkGoogle Scholar
  • Song JS, Zipkin PH (1996b) The joint effect of leadtime variance and lot size in a parallel processing environment. Management Sci. 42(9):1352–1363.LinkGoogle Scholar
  • Song JS, Zipkin P (2009) Inventories with multiple supply sources and networks of queues with overflow bypasses. Management Sci. 55(3):362–372.LinkGoogle Scholar
  • Stolyar AL, Wang Q (2022) Exploiting random lead times for significant inventory cost savings. Oper. Res. 70(4):2496–2516.LinkGoogle Scholar
  • Wang X (2021) Post-COVID lead times. Cumming Group (October 18), https://cumming-group.com/en/news-insights/blogs/post-covid-lead-times/.Google Scholar
  • Wang Y, Gerchak Y (1996) Periodic review production models with variable capacity, random yield, and uncertain demand. Management Sci. 42(1):130–137.LinkGoogle Scholar
  • White House (2023) Fact sheet: President Biden announces new actions to strengthen America’s supply chains, lower costs for families, and secure key sectors. Fact sheet, The White House, Washington, DC.Google Scholar
  • Xin L, Goldberg DA (2016) Optimality gap of constant-order policies decays exponentially in the lead time for lost sales models. Oper. Res. 64(6):1556–1565.LinkGoogle Scholar
  • Yano CA, Lee HL (1995) Lot sizing with random yields: A review. Oper. Res. 43(2):311–334.LinkGoogle Scholar
  • Yuan H, Luo Q, Shi C (2021) Marrying stochastic gradient descent with bandits: Learning algorithms for inventory systems with fixed costs. Management Sci. 67(10):6089–6115.LinkGoogle Scholar
  • Zhang H, Chao X, Shi C (2018) Perishable inventory systems: Convexity results for base-stock policies and learning algorithms under censored demand. Oper. Res. 66(5):1276–1286.LinkGoogle Scholar
  • Zhang H, Chao X, Shi C (2020) Closing the gap: A learning algorithm for lost-sales inventory systems with lead times. Management Sci. 66(5):1962–1980.LinkGoogle Scholar
  • Zipkin P (2008) On the structure of lost-sales inventory models. Oper. Res. 56(4):937–944.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.