Near-Optimal Mixed (s,S) Policy for a Multiwarehouse, Multistore Inventory System with Lost Sales and Fixed Cost

References

• Adelman D, Mersereau AJ (2008) Relaxations of weakly coupled stochastic dynamic programs. Oper. Res. 56(3):712–727.Link, Google Scholar
• Axsater S, Marklund J, Silver EA (2002) Heuristic methods for centralized control of one-warehouse, n-retailer inventory systems. Manufacturing Service Oper. Management 4(1):75–97.Link, Google Scholar
• Balseiro SR, Brown DB, Chen C (2019) Dynamic pricing of relocating resources in large networks. Sigmetrics Performance Evaluation Rev. 47(1):29–30.Crossref, Google Scholar
• Bensoussan A, Helal MA, Ramakrishna V, Sethi S (2020) Optimal policies for inventory systems with piecewise-linear concave ordering costs. Preprint, submitted June 9, https://dx.doi.org/10.2139/ssrn. 3601262.Google Scholar
• Bertsekas D (2012) Dynamic Programming and Optimal Control: Volume I (Athena Scientific, Belmont, MA).Google Scholar
• Bertsekas D, Nedic A (2003) Convex Analysis and Optimization (Athena Scientific, Belmont, MA).Google Scholar
• Boyd S, Xiao L, Mutapcic A (2003) Subgradient methods. Lecture Notes of EE392o, Stanford University, Autumn Quarter 2004:2004–2005.Google Scholar
• Brown DB, Smith JE (2020) Index policies and performance bounds for dynamic selection problems. Management Sci. 66(7):3029–3050.Link, Google Scholar
• Chao X, Jasin S, Miao S (2024) Adaptive algorithms for multi-warehouse multi-store inventory system with lost sales and fixed replenishment cost. Oper. Res., ePub ahead of print April 16, https://doi.org/10.1287/opre.2022.0668.Google Scholar
• Clark AJ, Scarf H (1960) Optimal policies for a multi-echelon inventory problem. Management Sci. 6(4):475–490.Link, Google Scholar
• Clark AJ, Scarf H (1962) Approximate solutions to a simple multi-echelon inventory problem. Studies in Applied Probability and Management Science (Stanford University Press, Stanford, CA), 88–110.Google Scholar
• Eppen G, Schrage L (1981) Centralized ordering policies in a multiwarehouse system with leadtimes and random demand. Schwarz LB, ed. Multi-Level Production/Inventory Control Systems: Theory and Practice (North Holland Publishing Co., Amsterdam), 51–67.Google Scholar
• Federgruen A, Zipkin P (1984) Approximations of dynamic, multilocation production and inventory problems. Management Sci. 30(1):69–84.Link, Google Scholar
• Guha S, Munagala K, Shi P (2010) Approximation algorithms for restless bandit problems. J. ACM 58(1):1–50.Crossref, Google Scholar
• Hiriart-Urruty JB, Lemaréchal C (2004) Fundamentals of Convex Analysis (Springer Science & Business Media, New York).Google Scholar
• Hu W, Frazier P (2017) An asymptotically optimal index policy for finite-horizon restless bandits. Preprint, submitted July 1, https://arxiv.org/abs/1707.00205.Google Scholar
• Iglehart DL (1963) Optimality of (s, S) policies in the infinite horizon dynamic inventory problem. Management Sci. 9(2):259–267.Link, Google Scholar
• Jackson PL (1988) Stock allocation in a two-echelon distribution system or “what to do until your ship comes in.” Management Sci. 34(7):880–895.Link, Google Scholar
• Jackson PL, Muckstadt JA (1989) Risk pooling in a two-period, two-echelon inventory stocking and allocation problem. Naval Res. Logist. 36(1):1–26.Crossref, Google Scholar
• Jasin S (2014) Reoptimization and self-adjusting price control for network revenue management. Oper. Res. 62(5):1168–1178.Link, Google Scholar
• Marklund J, Rosling K (2012) Lower bounds and heuristics for supply chain stock allocation. Oper. Res. 60(1):92–105.Link, Google Scholar
• McGavin EJ, Schwarz LB, Ward JE (1993) Two-interval inventory-allocation policies in a one-warehouse n-identical-retailer distribution system. Management Sci. 39(9):1092–1107.Link, Google Scholar
• McGavin EJ, Ward JE, Schwarz LB (1997) Balancing retailer inventories. Oper. Res. 45(6):820–830.Link, Google Scholar
• Miao S, Jasin S, Chao X (2022) Asymptotically optimal Lagrangian policies for multi-warehouse, multi-store systems with lost sales. Oper. Res. 70(1):141–159.Link, Google Scholar
• Nambiar M, Simchi-Levi D, Wang H (2019) Dynamic inventory allocation with demand learning for seasonal goods. Preprint, submitted November 5, https://dx.doi.org/10.2139/ssrn.3475708.Google Scholar
• Perera SC, Sethi SP (2023) A survey of stochastic inventory models with fixed costs: Optimality of (s, s) and (s, s)-type policies—Discrete-time case. Production Oper. Management 32(1):131–153.Crossref, Google Scholar
• Ross SM (1996) Stochastic Processes (Wiley, New York).Google Scholar
• Scarf H (1960) The optimality of (S, s) policies in the dynamic inventory systems. Mathematical Methods in the Social Sciences (ACM, New York), 49–56.Google Scholar
• Topaloglu H (2009) Using Lagrangian relaxation to compute capacity-dependent bid prices in network revenue management. Oper. Res. 57(3):637–649.Link, Google Scholar