{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:16:46Z","timestamp":1777954606716,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,16]]},"DOI":"10.1145\/3694906.3743338","type":"proceedings-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T16:19:56Z","timestamp":1752682796000},"page":"144-157","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Non-preemptive Throughput Maximization under Time-varying Capacity"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5995-471X","authenticated-orcid":false,"given":"Aniket","family":"Murhekar","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8650-2022","authenticated-orcid":false,"given":"Manish","family":"Purohit","sequence":"additional","affiliation":[{"name":"Google Research, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-0977-6618","authenticated-orcid":false,"given":"Zoya","family":"Svitkina","sequence":"additional","affiliation":[{"name":"Google Research, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4963-7582","authenticated-orcid":false,"given":"Erik","family":"Vee","sequence":"additional","affiliation":[{"name":"Google Research, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0770-0621","authenticated-orcid":false,"given":"Joshua","family":"Wang","sequence":"additional","affiliation":[{"name":"Google Research, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/502102.502107"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799354138"},{"key":"e_1_3_2_1_3_1","first-page":"65","article-title":"On-line scheduling to maximize task completions","volume":"39","author":"Baruah S","year":"2001","unstructured":"S Baruah, J Haritsa, and Nitin Sharma. On-line scheduling to maximize task completions. Journal of Combinatorial Mathematics and Combinatorial Computing, 39:65--78, 2001.","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335401"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_19"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.07.055"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1328675.1328684"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1060.0218"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206029"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022994010777"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519959"},{"key":"e_1_3_2_1_12_1","first-page":"906","volume-title":"Unsplittable flow on a path: The game! In SODA","author":"Grandoni Fabrizio","year":"2022","unstructured":"Fabrizio Grandoni, Tobias M\u00f6mke, and Andreas Wiese. Unsplittable flow on a path: The game! In SODA, pages 906--926, 2022. URL https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611977073.39."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61310-2_30"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(00)00061-4"},{"key":"e_1_3_2_1_15_1","first-page":"1070","volume-title":"SODA","author":"Im Sungjin","year":"2014","unstructured":"Sungjin Im, Shi Li, Benjamin Moseley, and Eric Torng. A dynamic programming framework for non-preemptive scheduling problems on multiple machines. In SODA, pages 1070--1086. SIAM, 2014."},{"key":"e_1_3_2_1_16_1","volume-title":"SIAM Journal on Discrete Mathematics, 34(3): 1649--1669","author":"Im Sungjin","year":"2020","unstructured":"Sungjin Im, Shi Li, and Benjamin Moseley. Breaking 1-1\/e barrier for nonpre-emptive throughput maximization. SIAM Journal on Discrete Mathematics, 34(3): 1649--1669, 2020."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-32726-1_18"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347479"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00074-9"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2003.05.019"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777416"},{"key":"e_1_3_2_1_22_1","first-page":"302","volume-title":"SODA","volume":"94","author":"Lipton Richard J","year":"1994","unstructured":"Richard J Lipton and Andrew Tomkins. Online interval scheduling. In SODA, volume 94, pages 302--311, 1994."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06901-7_30"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.30.2.391"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-015-0526-9"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1120060.1712351"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90150-3"}],"event":{"name":"SPAA '25: 37th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland OR USA","acronym":"SPAA '25","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694906.3743338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T19:18:24Z","timestamp":1777922304000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694906.3743338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":28,"alternative-id":["10.1145\/3694906.3743338","10.1145\/3694906"],"URL":"https:\/\/doi.org\/10.1145\/3694906.3743338","relation":{},"subject":[],"published":{"date-parts":[[2025,7,16]]},"assertion":[{"value":"2025-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}