{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T18:44:23Z","timestamp":1783536263029,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T00:00:00Z","timestamp":1783296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2216970 (IDEAL)"],"award-info":[{"award-number":["2216970 (IDEAL)"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Singapore Ministry of Education Academic Research Fund Tier 1","award":["RG15\/25"],"award-info":[{"award-number":["RG15\/25"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,6]]},"DOI":"10.1145\/3816782.3819225","type":"proceedings-article","created":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T17:28:33Z","timestamp":1783531713000},"page":"37-49","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Span Minimization for Flexible Uniform Jobs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6181-9958","authenticated-orcid":false,"given":"Mozhengfu","family":"Liu","sequence":"first","affiliation":[{"name":"Department of Computer Science, Northwestern University, Evanston, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5408-8023","authenticated-orcid":false,"given":"Samir","family":"Khuller","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Northwestern University, Evanston, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7404-7595","authenticated-orcid":false,"given":"Xueyan","family":"Tang","sequence":"additional","affiliation":[{"name":"College of Computing and Data Science, Nanyang Technological University, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"COCOA, Tianjin, China, November 28\u201330","author":"Albers S.","year":"2025","unstructured":"S. Albers and G. W. van der Heijden. Online busy time scheduling with flexible jobs. In COCOA, Tianjin, China, November 28\u201330, 2025."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087570"},{"key":"e_1_3_2_1_4_1","volume-title":"Tight bounds for clairvoyant dynamic bin packing. ACM Transactions on Parallel Computing (TOPC), 6(3):1\u201321","author":"Azar Y.","year":"2019","unstructured":"Y. Azar and D. Vainstein. Tight bounds for clairvoyant dynamic bin packing. ACM Transactions on Parallel Computing (TOPC), 6(3):1\u201321, 2019."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109598"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/290169"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9807-y"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-017-0531-3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538582"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.05.011"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210018"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46078-8_23"},{"key":"e_1_3_2_1_13_1","volume-title":"IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010","author":"Khandekar R.","year":"2010","unstructured":"R. Khandekar, B. Schieber, H. Shachnai, and T. Tamir. Minimizing busy time in multiple machine real-time scheduling. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2010."},{"key":"e_1_3_2_1_14_1","first-page":"532","volume-title":"Workshop on Algorithms and Data Structures","author":"Koehler F.","unstructured":"F. Koehler and S. Khuller. Busy time scheduling on a bounded number of machines. In Workshop on Algorithms and Data Structures, pages 521\u2013532. Springer, 2017."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11590156_12"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612675"},{"key":"e_1_3_2_1_17_1","volume-title":"Online span minimization for flexible uniform jobs","author":"Liu M.","year":"2026","unstructured":"M. Liu, S. Khuller, and X. Tang. Online span minimization for flexible uniform jobs, 2026. arXiv:2606.06681."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3626183.3660263"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087562"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2630052"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.3"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218048"},{"key":"e_1_3_2_1_23_1","first-page":"831","volume-title":"Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms","author":"Winkler P.","year":"2003","unstructured":"P. Winkler and L. Zhang. Wavelength assignment and generalized interval graph coloring. In Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pages 830\u2013831, 2003."}],"event":{"name":"SPAA '26: 38th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Royal Holloway, University of London London United Kingdom","acronym":"SPAA '26","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","EATCS"]},"container-title":["Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3816782.3819225","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3816782.3819225","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T17:29:59Z","timestamp":1783531799000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3816782.3819225"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,6]]},"references-count":23,"alternative-id":["10.1145\/3816782.3819225","10.1145\/3816782"],"URL":"https:\/\/doi.org\/10.1145\/3816782.3819225","relation":{},"subject":[],"published":{"date-parts":[[2026,7,6]]},"assertion":[{"value":"2026-07-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}