Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time

References

• [1] Adelman D, Klabjan D (2005) Duality and existence of optimal policies in generalized joint replenishment. Math. Oper. Res. 30(1):28–50.Link, Google Scholar
• [2] Aksoy Y, Erengüç ŞS (1988) Multi-item inventory models with co-ordinated replenishments: A survey. Internat. J. Oper. Production Management 8(1):63–73.Crossref, Google Scholar
• [3] Alon N, Spencer JH (2016) The Probabilistic Method, 4th ed. (John Wiley & Sons, Hoboken, NJ).Google Scholar
• [4] Arora S (1998) Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5):753–782.Crossref, Google Scholar
• [5] Bastos LDSL, Mendes ML, Nunes DRDL, Melo ACS, Carneiro MP (2017) A systematic literature review on the joint replenishment problem solutions: 2006–2015. Production 27:e20162229.Crossref, Google Scholar
• [6] Cohen-Hillel T, Yedidsion L (2018) The periodic joint replenishment problem is strongly NP-hard. Math. Oper. Res. 43(4):1269–1289.Link, Google Scholar
• [7] Gayon J, Massonnet G, Rapine C, Stauffer G (2017) Fast approximation algorithms for the one-warehouse multi-retailer problem under general cost structures and capacity constraints. Math. Oper. Res. 42(3):854–875.Link, Google Scholar
• [8] Goyal SK, Satir AT (1989) Joint replenishment inventory control: Deterministic and stochastic models. Eur. J. Oper. Res. 38(1):2–13.Crossref, Google Scholar
• [9] Jackson P, Maxwell W, Muckstadt J (1985) The joint replenishment problem with a powers-of-two restriction. IIE Trans. 17(1):25–32.Crossref, Google Scholar
• [10] Khouja M, Goyal S (2008) A review of the joint replenishment problem literature: 1989–2005. Eur. J. Oper. Res. 186(1):1–16.Crossref, Google Scholar
• [11] Levi R, Roundy R, Shmoys DB, Sviridenko M (2008) A constant approximation algorithm for the one-warehouse multiretailer problem. Management Sci. 54(4):763–776.Link, Google Scholar
• [12] Lu L, Posner ME (1994) Approximation procedures for the one-warehouse multi-retailer system. Management Sci. 40(10):1305–1316.Link, Google Scholar
• [13] Maxwell WL, Muckstadt JA (1985) Establishing consistent and realistic reorder intervals in production-distribution systems. Oper. Res. 33(6):1316–1341.Link, Google Scholar
• [14] Muckstadt JA, Roundy RO (1987) Multi-item, one-warehouse, multi-retailer distribution systems. Management Sci. 33(12):1613–1621.Link, Google Scholar
• [15] Muckstadt JA, Roundy RO (1993) Analysis of multistage production systems. Graves SC, Kan AHGR, Zipkin PH, eds. Logistics of Production and Inventory, Handbooks in Operations Research and Management Science, vol. 4 (Elsevier, Amsterdam), 59–131.Crossref, Google Scholar
• [16] Muckstadt JA, Sapra A (2010) Principles of Inventory Management: When You Are Down to Four, Order More (Springer Science & Business Media, Berlin).Crossref, Google Scholar
• [17] Nonner T, Sviridenko M (2013) An efficient polynomial-time approximation scheme for the joint replenishment problem. Goemans M, Correa J, eds. Proc. 16th Internat. Conf. Integer Programming Combin. Optim. (Springer, Berlin), 314–323.Google Scholar
• [18] Roundy R (1985) 98%-effective integer-ratio lot-sizing for one-warehouse multi-retailer systems. Management Sci. 31(11):1416–1430.Link, Google Scholar
• [19] Roundy R (1986) A 98%-effective lot-sizing rule for a multi-product, multi-stage production/inventory system. Math. Oper. Res. 11(4):699–727.Link, Google Scholar
• [20] Schulz AS, Telha C (2011) Approximation algorithms and hardness results for the joint replenishment problem with constant demands. Demetrescu C, Halldórsson MM, eds. Proc. 19th Annual Eur. Sympos. Algorithms (Springer, Berlin), 628–639.Google Scholar
• [21] Schulz AS, Telha C (2024) Integer factorization: Why two-item joint replenishment is hard. Oper. Res. 72(3):1192–1202.Link, Google Scholar
• [22] Segev D (2014) An approximate dynamic-programming approach to the joint replenishment problem. Math. Oper. Res. 39(2):432–444.Link, Google Scholar
• [23] Segev D (2025) The continuous-time joint replenishment problem: ϵ-optimal policies via pairwise alignment. Management Sci. 71(5):4183–4197.Link, Google Scholar
• [24] Segev D (2026) Improved approximation guarantees for joint replenishment in continuous time. Math. Oper. Res. 51(2):1683–1712.Link, Google Scholar
• [25] Silver EA, Peterson R (1985) Decision Systems for Inventory Management and Production Planning (Wiley, New York).Google Scholar
• [26] Simchi-Levi D, Chen X, Bramel J (2014) The Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management, 3rd ed. (Springer Science & Business Media, Berlin).Crossref, Google Scholar
• [27] Sun D (2004) Existence and properties of optimal production and inventory policies. Math. Oper. Res. 29(4):923–934.Link, Google Scholar
• [28] Teo CP, Bertsimas D (2001) Multistage lot sizing problems via randomized rounding. Oper. Res. 49(4):599–608.Link, Google Scholar
• [29] Tuisov A, Yedidsion L (2020) The continuous joint replenishment problem is strongly NP-hard. Preprint, submitted June 7, https://arxiv.org/abs/2006.05310.Google Scholar
• [30] Wagner HM, Whitin TM (1958) Dynamic version of the economic lot size model. Management Sci. 5(1):89–96.Link, Google Scholar
• [31] Zipkin PH (2000) Foundations of Inventory Management (McGraw-Hill, New York).Google Scholar