{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T05:01:36Z","timestamp":1782363696474,"version":"3.54.5"},"reference-count":37,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematics of OR"],"published-print":{"date-parts":[[2026,5]]},"abstract":"<jats:p>The primary objective of this work is to revisit and revitalize one of the most fundamental models in deterministic inventory management, the continuous-time joint replenishment problem. Our main contribution consists of resolving several long-standing open questions in this context. For most of these questions, we obtain the first quantitative improvement over power-of-2 policies and their nearby derivatives, which have been state-of-the-art in terms of provable performance guarantees since the mid-80s.<\/jats:p>\n                  <jats:p>Funding: This work was supported by the Israel Science Foundation [Grant 1407\/20].<\/jats:p>","DOI":"10.1287\/moor.2024.0635","type":"journal-article","created":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T12:06:27Z","timestamp":1749729987000},"page":"1683-1712","source":"Crossref","is-referenced-by-count":1,"title":["Improved Approximation Guarantees for Joint Replenishment in Continuous Time"],"prefix":"10.1287","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4684-2185","authenticated-orcid":false,"given":"Danny","family":"Segev","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences and Coller School of Management, Tel Aviv University, Tel Aviv 69978, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"109","reference":[{"key":"B1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-57265-8"},{"key":"B2","doi-asserted-by":"publisher","DOI":"10.1108\/eb054814"},{"key":"B3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.39.2.233"},{"key":"B4","doi-asserted-by":"publisher","DOI":"10.1590\/0103-6513.222916"},{"key":"B5","doi-asserted-by":"crossref","unstructured":"Bienkowski M, Byrka J, Chrobak M, Jez L, Nogneng D, Sgall J (2014) Better approximation bounds for the joint replenishment problem. Chekuri C, ed.\n                      Proc. 25th Annual ACM-SIAM Sympos. Discrete Algorithms\n                      (Society for Industrial and Applied Mathematics, Philadelphia), 42\u201354.","DOI":"10.1137\/1.9781611973402.4"},{"key":"B6","first-page":"3","volume":"8","author":"Bonferroni C","year":"1936","journal-title":"Publ. R. Istituto Superiore Sci. Econom. Commerciali Firenze"},{"key":"B7","doi-asserted-by":"crossref","unstructured":"Bosman T, Olver N (2020) Improved approximation algorithms for inventory problems. Bienstock D, Zambelli G, eds.\n                      Proc. 21st Internat. Conf. Integer Programming Combin. Optim.\n                      (Springer-Verlag, Berlin), 91\u2013103.","DOI":"10.1007\/978-3-030-45771-6_8"},{"key":"B8","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0904"},{"key":"B9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.5.764"},{"key":"B10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274"},{"key":"B11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.4.580"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0830"},{"key":"B13","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90463-3"},{"key":"B14","doi-asserted-by":"publisher","DOI":"10.1080\/07408178508975268"},{"key":"B15","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.34.8.938"},{"key":"B16","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-019-00581-w"},{"key":"B17","doi-asserted-by":"publisher","DOI":"10.1287\/moor.26.2.324.10559"},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.03.007"},{"key":"B19","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-019-00566-9"},{"key":"B20","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1070.0781"},{"key":"B21","doi-asserted-by":"publisher","DOI":"10.1287\/opre.33.6.1316"},{"key":"B22","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.33.12.1613"},{"key":"B23","first-page":"59","volume-title":"Handbooks in Operations Research and Management Science","volume":"4","author":"Muckstadt JA","year":"1993"},{"key":"B24","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68948-7"},{"key":"B25","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.31.11.1416"},{"key":"B26","doi-asserted-by":"publisher","DOI":"10.1287\/moor.11.4.699"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.35.12.1433"},{"key":"B28","doi-asserted-by":"crossref","unstructured":"Schulz AS, Telha C (2011) Approximation algorithms and hardness results for the joint replenishment problem with constant demands. Demetrescu C, Halld\u00f3rsson MM, eds.\n                      Proc. 19th Annual Eur. Sympos. Algorithms\n                      (Springer, Berlin), 628\u2013639.","DOI":"10.1007\/978-3-642-23719-5_53"},{"key":"B29","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2390"},{"key":"B30","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2023.00705"},{"key":"B31","volume-title":"Decision Systems for Inventory Management and Production Planning","author":"Silver EA","year":"1985"},{"key":"B32","volume-title":"The Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management","author":"Simchi-Levi D","year":"1997"},{"key":"B33","doi-asserted-by":"crossref","unstructured":"Suriyanarayana V, Sivashankar V, Gollapudi S, Shmoys DB (2024) Improved approximation algorithms for the joint replenishment problem with outliers, and with fairness constraints. Woodruff DP, ed.\n                      Proc. 2024 ACM-SIAM Sympos. Discrete Algorithms\n                      (Society for Industrial and Applied Mathematics, Philadelphia), 2793\u20132828.","DOI":"10.1137\/1.9781611977912.99"},{"key":"B34","doi-asserted-by":"publisher","DOI":"10.1287\/opre.49.4.599.11222"},{"key":"B35","unstructured":"Tuisov A, Yedidsion L (2020) The continuous joint replenishment problem is strongly NP-hard. Preprint, submitted June 7, https:\/\/arxiv.org\/abs\/2006.05310."},{"key":"B36","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2014.179.3.7"},{"key":"B37","volume-title":"Foundations of Inventory Management","author":"Zipkin PH","year":"2000"}],"container-title":["Mathematics of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/moor.2024.0635","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T08:24:50Z","timestamp":1778228690000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubsonline.informs.org\/doi\/10.1287\/moor.2024.0635"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["10.1287\/moor.2024.0635"],"URL":"https:\/\/doi.org\/10.1287\/moor.2024.0635","relation":{},"ISSN":["0364-765X","1526-5471"],"issn-type":[{"value":"0364-765X","type":"print"},{"value":"1526-5471","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]}}}