Tailored Base-Surge Policies in Dual-Sourcing Inventory Systems with Demand Learning

Published Online:https://doi.org/10.1287/opre.2022.0624

References

  • Agarwal A, Foster DP, Hsu D, Kakade SM, Rakhlin A (2011) Stochastic convex optimization with bandit feedback. Shawe-Taylor J, Zemel R, Bartlett P, Pereira F, Weinberger K, eds. Proc. 24th Internat. Conf. Neural Inform. Processing Systems, PMLR (Curran Associates Inc., Red Hook, NY), 1035–1043.Google Scholar
  • 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
  • Allon G, Van Mieghem JA (2010) Global dual sourcing: Tailored base-surge allocation to near-and offshore production. Management Sci. 56(1):110–124.LinkGoogle Scholar
  • Angelus A, Özer Ö (2016) Knowledge you can act on: Optimal policies for assembly systems with expediting and advance demand information. Oper. Res. 64(6):1338–1371.LinkGoogle Scholar
  • Austin C (2021) How the supply chain caused current inflation, and why it might be here to stay? Accessed December 11, 2023, https://www.pbs.org/newshour/economy/how-the-supply-chain-caused-current-inflation-and-why-it-might-be-here-to-stay.Google Scholar
  • Azoury KS (1985) Bayes solution to dynamic inventory models under unknown demand distribution. Management Sci. 31(9):1150–1160.LinkGoogle Scholar
  • Ban GY, Rudin C (2018) The big data newsvendor: Practical insights from machine learning. Oper. Res. 67(1):90–108.LinkGoogle Scholar
  • Besbes O, Gur Y, Zeevi A (2015) Non-stationary stochastic optimization. Oper. Res. 63(5):1227–1244.LinkGoogle Scholar
  • Besbes O, Muharremoglu A (2013) On implications of demand censoring in the newsvendor problem. Management Sci. 59(6):1407–1424.LinkGoogle Scholar
  • Boute RN, Van Mieghem JA (2015) Global dual sourcing and order smoothing: The impact of capacity and lead times. Management Sci. 61(9):2080–2099.LinkGoogle Scholar
  • Bubeck S, Eldan R, Lee YT (2021) Kernel-based methods for bandit convex optimization. J. ACM. 68(4):1–35.CrossrefGoogle Scholar
  • Burnetas AN, Smith CE (2000) Adaptive ordering and pricing for perishable products. Oper. Res. 48(3):436–443.LinkGoogle Scholar
  • Chen B, Chao X (2020) Dynamic inventory control with stockout substitution and demand learning. Management Sci. 66(11):5108–5127.LinkGoogle Scholar
  • Chen B, Chao X, Ahn HS (2019) Coordinating pricing and inventory replenishment with nonparametric demand learning. Oper. Res. 67(4):1035–1052.AbstractGoogle Scholar
  • Chen B, Chao X, Shi C (2021) Nonparametric learning algorithms for joint pricing and inventory control with lost sales and censored demand. Math. Oper. Res. 46(2):726–756.LinkGoogle Scholar
  • Chen B, Jiang J, Zhang J, Zhou Z (2024) Learning to order for inventory systems with lost sales and uncertain supplies. Preprint, submitted July 10, 2022, https://arxiv.org/abs/2207.04550.Google Scholar
  • Chen L, Plambeck EL (2008) Dynamic inventory management with learning about the demand distribution and substitution probability. Manufacturing Service Oper. Management 10(2):236–256.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, Liu Y, Hong G (2023) An online learning approach to dynamic pricing and capacity sizing in service systems. Preprint, submitted September 7, 2020, https://arxiv.org/abs/2009.02911.Google Scholar
  • Chen Y, Xue W, Yang J (2013) Optimal inventory policy in the presence of a long-term supplier and a spot market. Oper. Res. 61(1):88–97.LinkGoogle Scholar
  • Chu LY, Shanthikumar JG, Shen ZJM (2008) Solving operational statistics via a Bayesian analysis. Oper. Res. Lett. 36(1):110–116.CrossrefGoogle Scholar
  • den Boer AV, Chen B, Wang Y (2024) Pricing and positioning of horizontally differentiated products with incomplete demand information. Oper. Res. 72(6):2446–2466.Google Scholar
  • Fan X, Chen B, Zhou Z (2022) Sample complexity of policy learning for inventory control with censored demand. Technical report, New York University, New York.Google Scholar
  • Federgruen A, Liu Z, Lu L (2022) Dual sourcing: Creating and utilizing flexible capacities with a second supply source. Production Oper. Management 31(7):2789–2805.CrossrefGoogle Scholar
  • Feng Q, Sethi SP, Yan H, Zhang H (2006) Are base-stock policies optimal in inventory problems with multiple delivery modes? Oper. Res. 54(4):801–807.LinkGoogle Scholar
  • Fox EJ, Metters R, Semple J (2006) Optimal inventory policy with two suppliers. Oper. Res. 54(2):389–393.LinkGoogle Scholar
  • Fukuda Y (1964) Optimal policies for the inventory problem with negotiable leadtime. Management Sci. 10(4):690–708.LinkGoogle Scholar
  • Godfrey GA, Powell WB (2001) An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution. Management Sci. 47(8):1101–1112.LinkGoogle Scholar
  • Gong X, Chao X, Zheng S (2014) Dynamic pricing and inventory management with dual suppliers of different lead times and disruption risks. Production Oper. Management 23(12):2058–2074.CrossrefGoogle Scholar
  • Hua Z, Yu Y, Zhang W, Xu X (2015) Structural properties of the optimal policy for dual-sourcing systems with general lead times. IISE Transactions 47(8):841–850.CrossrefGoogle Scholar
  • Huggins EL, Olsen TL (2010) Inventory control with generalized expediting. Oper. Res. 58(5):1414–1426.LinkGoogle Scholar
  • Huh W, Janakiraman G, Muckstadt J, Rusmevichientong P (2009) 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, Levi R, Rusmevichientong P, Orlin JB (2011) Adaptive data-driven inventory control with censored demand based on Kaplan-Meier estimator. Oper. Res. 59(4):929–941.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
  • Iglehart DL (1964) The dynamic inventory problem with unknown demand distribution. Management Sci. 10(3):429–440.LinkGoogle Scholar
  • Janakiraman G, Seshadri S, Sheopuri A (2014) Analysis of tailored base-surge policies in dual sourcing inventory systems. Management Sci. 61(7):1547–1561.LinkGoogle Scholar
  • Kelleher K (2003) Why FedEx is gaining ground. Business (Atlanta, GA) 2(1):56–57.Google Scholar
  • Kingman J (1970) Inequalities in the theory of queues. J. R. Stat. Soc. B. 32(1):102–110.CrossrefGoogle Scholar
  • Kleinberg R (2004) Nearly tight bounds for the continuum-armed bandit problem. Saul L, Weiss Y, Bottou L, eds. Proc. 17th Internat. Conf. Neural Inform. Processing Systems, NIPS’04 (MIT Press, Cambridge, MA), 697–704.Google Scholar
  • Kleywegt AJ, Shapiro A, Homem-de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.CrossrefGoogle Scholar
  • Lattimore T (2024) Bandit Convex Optimisation (Google DeepMind, London).Google Scholar
  • Lattimore T, Gyorgy A (2021) Improved regret for zeroth-order stochastic convex bandits. Belkin M, Kpotufe S, eds. Proc. Thirty Fourth Conf. Learn. Theory, Proceedings of Machine Learning Research, vol. 134 (PMLR, New York), 2938–2964.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
  • Levi R, Roundy RO, Shmoys DB (2007) Provably near-optimal sampling-based policies for stochastic inventory control models. Math. Oper. Res. 32(4):821–839.LinkGoogle Scholar
  • Liyanage LH, Shanthikumar JG (2005) A practical inventory control policy using operational statistics. Oper. Res. Lett. 33(4):341–348.CrossrefGoogle Scholar
  • Loynes RM (1962) The stability of a queue with non-independent inter-arrival and service times. Green BJ, ed. Mathematical Proceedings of the Cambridge Philosophical Society, vol. 58 (Cambridge University Press, Cambridge, UK), 497–520.Google Scholar
  • Lu X, Song JS, Zhu K (2005) On “the censored newsvendor and the optimal acquisition of information”. Oper. Res. 53(6):1024–1026.LinkGoogle Scholar
  • Lu X, Song JS, Zhu K (2008) Analysis of perishable-inventory systems with censored demand data. Oper. Res. 56(4):1034–1038.LinkGoogle Scholar
  • Murray GR, Silver EA (1966) A Bayesian analysis of the style goods inventory problem. Management Sci. 12(11):785–797.LinkGoogle Scholar
  • Powell W, Ruszczyński A, Topaloglu H (2004) Learning algorithms for separable approximations of discrete stochastic optimization problems. Math. Oper. Res. 29(4):814–836.LinkGoogle Scholar
  • Rao U, Scheller-Wolf A, Tayur S (2000) Development of a rapid-response supply chain at caterpillar. Oper. Res. 48(2):189–204.LinkGoogle Scholar
  • Robbins H (1952) Some aspects of the sequential design of experiments. Bull. Amer. Math. Soc. (N.S.) 58(5):527–535.CrossrefGoogle Scholar
  • Russo D, Van Roy B (2018) Learning to optimize via information-directed sampling. Oper. Res. 66(1):230–252.LinkGoogle Scholar
  • Scarf H (1959) Bayes solutions of the statistical inventory problem. Ann. Math. Statist. 30(2):490–508.CrossrefGoogle Scholar
  • Scheller-Wolf A, Veeraraghavan S, van Houtum GJ (2007) Effective dual sourcing with a single index policy. Working paper, Carnegie Mellon University, Pittsburgh.Google Scholar
  • Sheopuri A, Janakiraman G, Seshadri S (2010) New policies for the stochastic inventory control problem with two supply sources. Oper. Res. 58(3):734–745.LinkGoogle 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
  • Suggala AS, Ravikumar P, Netrapalli P (2021) Efficient bandit convex optimization: Beyond linear losses. Belkin M, Kpotufe S, eds. Proc. Thirty Fourth Conf. Learn. Theory, Proceedings of Machine Learning Research, vol. 134 (PMLR, Cambridge, MA), 4008–4067.Google Scholar
  • Sun J, Van Mieghem JA (2019) Robust dual sourcing inventory management: Optimality of capped dual index policies and smoothing. Manufacturing Service Oper. Management 21(4):912–931.LinkGoogle Scholar
  • Tang J, Chen B, Shi C (2024) Online learning for dual-index policies in dual-sourcing systems. Manufacturing Service Oper. Management 26(2):758–774.LinkGoogle Scholar
  • USBank (2023) How do supply chain issues contribute to inflation? Accessed December 11, 2023, https://www.usbank.com/investing/financial-perspectives/market-news/supply-chain-issues-contribution-to-inflation.html.Google Scholar
  • Veeraraghavan S, Scheller-Wolf A (2008) Now or later: A simple policy for effective dual sourcing in capacitated systems. Oper. Res. 56(4):850–864.LinkGoogle Scholar
  • Whittemore AS, Saunders S (1977) Optimal inventory under stochastic demand with two supply options. SIAM J. Appl. Math. 32(2):293–305.CrossrefGoogle Scholar
  • Xin L, Goldberg DA (2017) Asymptotic optimality of tailored base-surge policies in dual-sourcing inventory systems. Management Sci. 64(1):437–452.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
  • Zinkevich M (2003) Online convex programming and generalized infinitesimal gradient ascent. Holte R, ed. Proc. 20th Internat. Conf. Mach. Learn. (ACM Press, New York), 928–936.Google 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.