{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:50:05Z","timestamp":1767340205280,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T00:00:00Z","timestamp":1468195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Singapore Ministry of Education Academic Research Fund Tier 2","award":["MOE2013-T2-2-067"],"award-info":[{"award-number":["MOE2013-T2-2-067"]}]},{"name":"Singapore Ministry of Education Academic Research Fund Tier 1","award":["2013-T1-002-123"],"award-info":[{"award-number":["2013-T1-002-123"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,11]]},"DOI":"10.1145\/2935764.2935775","type":"proceedings-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T15:03:00Z","timestamp":1467990180000},"page":"227-237","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time"],"prefix":"10.1145","author":[{"given":"Runtian","family":"Ren","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Xueyan","family":"Tang","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2016,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Amazon EC2 pricing. http:\/\/aws.amazon.com\/ec2\/pricing\/.  Amazon EC2 pricing. http:\/\/aws.amazon.com\/ec2\/pricing\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Gaikai. http:\/\/www.gaikai.com\/.  Gaikai. http:\/\/www.gaikai.com\/."},{"key":"e_1_3_2_1_3_1","unstructured":"Onlive. http:\/\/www.onlive.com\/.  Onlive. http:\/\/www.onlive.com\/."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_5"},{"volume-title":"Cambridge University Press Cambridge","year":"1998","author":"Borodin A.","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.028"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11809678_33"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612689"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212014"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161017"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2537855"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787488"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46078-8_23"},{"key":"e_1_3_2_1_14_1","first-page":"169","volume-title":"FSTTCS 2010: Foundations of Software Technology and Theoretical Computer Science","author":"Khandekar R.","year":"2010"},{"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\/2733373.2807978"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612675"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2015.2450152"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2393868"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.31"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787505"},{"key":"e_1_3_2_1_22_1","unstructured":"R. Ren and X. Tang. Clairvoyant dynamic bin packing for job scheduling with minimum server usage time (extended version). Available at http:\/\/www.ntu.edu.sg\/home\/asxytang\/.  R. Ren and X. Tang. Clairvoyant dynamic bin packing for job scheduling with minimum server usage time (extended version). Available at http:\/\/www.ntu.edu.sg\/home\/asxytang\/."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.07.017"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.42"},{"volume-title":"Springer Science & Business Media","year":"2013","author":"Vazirani V. V.","key":"e_1_3_2_1_25_1"}],"event":{"name":"SPAA '16: 28th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Pacific Grove California USA","acronym":"SPAA '16"},"container-title":["Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935775","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2935764.2935775","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:39:56Z","timestamp":1750217996000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":25,"alternative-id":["10.1145\/2935764.2935775","10.1145\/2935764"],"URL":"https:\/\/doi.org\/10.1145\/2935764.2935775","relation":{},"subject":[],"published":{"date-parts":[[2016,7,11]]},"assertion":[{"value":"2016-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}