The Continuous-Time Joint Replenishment Problem: ϵ-Optimal Policies via Pairwise Alignment

References

• Aigner M, Ziegler GM (2018) Proofs from THE BOOK, 6th ed. (Springer, Berlin).Crossref, Google Scholar
• Aksoy Y, Erenguc SS (1988) Multi-item inventory models with co-ordinated replenishments: A survey. Internat. J. Oper. Production Management 8(1):63–73.Crossref, Google Scholar
• 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
• 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
• 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
• Goyal SK, Satir AT (1989) Joint replenishment inventory control: Deterministic and stochastic models. Eur. J. Oper. Res. 38(1):2–13.Crossref, Google Scholar
• 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
• Kao EPC (1979) A multi-product dynamic lot-size model with individual and joint set-up costs. Oper. Res. 27(2):279–289.Link, Google Scholar
• 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
• 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
• Lu L, Posner ME (1994) Approximation procedures for the one-warehouse multi-retailer system. Management Sci. 40(10):1305–1316.Link, Google Scholar
• Maxwell WL, Muckstadt JA (1985) Establishing consistent and realistic reorder intervals in production-distribution systems. Oper. Res. 33(6):1316–1341.Link, Google Scholar
• Muckstadt JA, Roundy RO (1987) Multi-item, one-warehouse, multi-retailer distribution systems. Management Sci. 33(12):1613–1621.Link, Google Scholar
• Muckstadt JA, Roundy RO (1993) Analysis of multistage production systems. Graves SC, Kan AHGR, Zipkin PH, eds. Handbooks in Operations Research and Management Science, vol. 4 (Elsevier, New York), 59–131.Google Scholar
• Muckstadt JA, Sapra A (2010) Principles of Inventory Management: When You Are Down to Four, Order More (Springer Science & Business Media, Boston).Crossref, Google Scholar
• Nonner T, Sviridenko M (2013) An efficient polynomial-time approximation scheme for the joint replenishment problem. Goemans MX, Correa J, eds. Proc. 16th Internat. Conf. Integer Programming Combinatorial Optim. (Springer, Berlin, Heidelberg), 314–323.Google Scholar
• Roundy R (1985) 98%-effective integer-ratio lot-sizing for one-warehouse multi-retailer systems. Management Sci. 31(11):1416–1430.Link, Google Scholar
• 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
• 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, Heidelberg), 628–639.Google Scholar
• Schulz AS, Telha C (2024) Integer factorization: Why two-item joint replenishment is hard. Oper. Res. 72(3):1192–1202.Link, Google Scholar
• Segev D (2014) An approximate dynamic-programming approach to the joint replenishment problem. Math. Oper. Res. 39(2):432–444.Link, Google Scholar
• Silver EA, Peterson R (1985) Decision Systems for Inventory Management and Production Planning (Wiley, New York).Google Scholar
• Teo CP, Bertsimas D (2001) Multistage lot sizing problems via randomized rounding. Oper. Res. 49(4):599–608.Link, Google Scholar
• 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
• Veinott AF (1969) Minimum concave-cost solution of Leontief substitution models of multi-facility inventory systems. Oper. Res. 17(2):262–291.Link, Google Scholar
• Zangwill WI (1966) A deterministic multiproduct, multi-facility production and inventory model. Oper. Res. 14(3):486–507.Link, Google Scholar
• Zhang Y (2014) Bounded gaps between primes. Ann. Math. 179(3):1121–1174.Crossref, Google Scholar
• Zipkin PH (2000) Foundations of Inventory Management (McGraw-Hill, New York).Google Scholar