{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:59Z","timestamp":1759638419207,"version":"3.41.0"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2014,3,17]],"date-time":"2014-03-17T00:00:00Z","timestamp":1395014400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2014,3,17]]},"DOI":"10.1145\/2596583.2596603","type":"journal-article","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T13:45:50Z","timestamp":1395668750000},"page":"91-102","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Online aggregation problems"],"prefix":"10.1145","volume":"45","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[{"name":"University of California at Riverside"}]}],"member":"320","published-online":{"date-parts":[[2014,3,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.3.549"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90001-1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39206-1_12"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.4"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40104-6_12"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9567-5"},{"key":"e_1_2_1_7_1","first-page":"952","volume-title":"Proc. of the 19th ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Buchbinder Niv","year":"2008","unstructured":"Niv Buchbinder , Tracy Kimbrel , Retsef Levi , Konstantin Makarychev , and Maxim Sviridenko . Online make-to-order joint replenishment model: primal dual competitive algorithms . In Proc. of the 19th ACM-SIAM Symp. on Discrete Algorithms (SODA) , pages 952 -- 961 , 2008 . Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, and Maxim Sviridenko. Online make-to-order joint replenishment model: primal dual competitive algorithms. In Proc. of the 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 952--961, 2008."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276792"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375843"},{"key":"e_1_2_1_10_1","first-page":"135","article-title":"How many parts to make at once. Factory","volume":"10","author":"Harris Ford Whitman","year":"1913","unstructured":"Ford Whitman Harris . How many parts to make at once. Factory : The Magazine of Management , 10 : 135 -- 136 , 152, 1913 . Ford Whitman Harris. How many parts to make at once. Factory: The Magazine of Management, 10:135--136, 152, 1913.","journal-title":"The Magazine of Management"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1013-x"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684581"},{"key":"e_1_2_1_13_1","first-page":"365","volume-title":"Proc. of the 16th ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Levi Retsef","year":"2005","unstructured":"Retsef Levi , Robin Roundy , and David B. Shmoys . A constant approximation algorithm for the one-warehouse multi-retailer problem . In Proc. of the 16th ACM-SIAM Symp. on Discrete Algorithms (SODA) , pages 365 -- 374 , 2005 . Retsef Levi, Robin Roundy, and David B. Shmoys. A constant approximation algorithm for the one-warehouse multi-retailer problem. In Proc. of the 16th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 365--374, 2005."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1070.0781"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_19"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335385"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.5.1.89"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2596583.2596603","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2596583.2596603","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:10:04Z","timestamp":1750234204000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2596583.2596603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,17]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,3,17]]}},"alternative-id":["10.1145\/2596583.2596603"],"URL":"https:\/\/doi.org\/10.1145\/2596583.2596603","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2014,3,17]]},"assertion":[{"value":"2014-03-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}