{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:37Z","timestamp":1759638037798},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,8,27]],"date-time":"2014-08-27T00:00:00Z","timestamp":1409097600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10951-014-0392-y","type":"journal-article","created":{"date-parts":[[2014,8,26]],"date-time":"2014-08-26T05:59:53Z","timestamp":1409032793000},"page":"545-560","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Approximation algorithms for the joint replenishment problem with deadlines"],"prefix":"10.1007","volume":"18","author":[{"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaros\u0142aw","family":"Byrka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Chrobak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neil","family":"Dobbs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Nowicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Sviridenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"\u015awirszcz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neal E.","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,27]]},"reference":[{"issue":"1\u20132","key":"392_CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti, P., & Kann, V. (2000). Some APX-completeness results for cubic graphs. Theoretical Computer Science, 237(1\u20132), 123\u2013134.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"392_CR2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(89)90001-1","volume":"8","author":"E Arkin","year":"1989","unstructured":"Arkin, E., Joneja, D., & Roundy, R. (1989). Computational complexity of uncapacitated multi-echelon production planning problems. Operations Research Letters, 8(2), 61\u201366.","journal-title":"Operations Research Letters"},{"issue":"1","key":"392_CR3","doi-asserted-by":"crossref","first-page":"13:1","DOI":"10.1145\/1644015.1644028","volume":"6","author":"L Becchetti","year":"2009","unstructured":"Becchetti, L., Marchetti-Spaccamela, A., Vitaletti, A., Korteweg, P., Skutella, M., & Stougie, L. (2009). Latency-constrained aggregation in sensor networks. ACM Transactions on Algorithms, 6(1), 13:1\u201313:20.","journal-title":"ACM Transactions on Algorithms"},{"key":"392_CR4","doi-asserted-by":"crossref","unstructured":"Bienkowski, M., Byrka, J., Chrobak, M., Je\u017c, \u0141., & Sgall, J. (2014). Better approximation bounds for the joint replenishment problem. In: Proceedings of the of the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 42\u201354.","DOI":"10.1137\/1.9781611973402.4"},{"issue":"4","key":"392_CR5","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1007\/s00453-011-9567-5","volume":"64","author":"C Brito","year":"2012","unstructured":"Brito, C., Koutsoupias, E., & Vaya, S. (2012). Competitive analysis of organization networks or multicast acknowledgement: How much to wait? Algorithmica, 64(4), 584\u2013605.","journal-title":"Algorithmica"},{"key":"392_CR6","unstructured":"Buchbinder, N., Kimbrel, T., Levi, R., Makarychev, K., & Sviridenko, M. (2008). Online make-to-order joint replenishment model: Primal dual competitive algorithms. In: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 952\u2013961."},{"key":"392_CR7","doi-asserted-by":"crossref","unstructured":"Khanna, S., Naor, J., & Raz, D. (2002). Control message aggregation in group communication protocols. In: Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP), pp. 135\u2013146.","DOI":"10.1007\/3-540-45465-9_13"},{"key":"392_CR8","unstructured":"Levi, R., Roundy, R., & Shmoys, D.B. (2005). A constant approximation algorithm for the one-warehouse multi-retailer problem. In: Proceedings of the Sixteenth Annual ACM-SIAM symposium on Discrete Algorithms (SODA), pp. 365\u2013374."},{"issue":"2","key":"392_CR9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/moor.1050.0178","volume":"31","author":"R Levi","year":"2006","unstructured":"Levi, R., Roundy, R., & Shmoys, D. B. (2006). Primal-dual algorithms for deterministic inventory problems. Mathematics of Operations Research, 31(2), 267\u2013284.","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"392_CR10","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1287\/mnsc.1070.0781","volume":"54","author":"R Levi","year":"2008","unstructured":"Levi, R., Roundy, R., Shmoys, D. B., & Sviridenko, M. (2008). A constant approximation algorithm for the one-warehouse multiretailer problem. Management Science, 54(4), 763\u2013776.","journal-title":"Management Science"},{"key":"392_CR11","doi-asserted-by":"crossref","unstructured":"Levi, R., & Sviridenko, M. (2006). Improved approximation algorithm for the one-warehouse multi-retailer problem. In: Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), pp. 188\u2013199.","DOI":"10.1007\/11830924_19"},{"issue":"2","key":"392_CR12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1142\/S1793830909000130","volume":"1","author":"T Nonner","year":"2009","unstructured":"Nonner, T., & Souza, A. (2009). Approximating the joint replenishment problem with deadlines. Discrete Mathematics, Algorithms and Applications, 1(2), 153\u2013174.","journal-title":"Discrete Mathematics, Algorithms and Applications"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0392-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-014-0392-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0392-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:50Z","timestamp":1559468390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-014-0392-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,27]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["392"],"URL":"https:\/\/doi.org\/10.1007\/s10951-014-0392-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,27]]}}}