{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:57:59Z","timestamp":1759939079338,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T00:00:00Z","timestamp":1469577600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T00:00:00Z","timestamp":1469577600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1216993","CCF- 1217314"],"award-info":[{"award-number":["CCF-1216993","CCF- 1217314"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1536026","OISE-1157129"],"award-info":[{"award-number":["CCF-1536026","OISE-1157129"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CAREER award 1053605"],"award-info":[{"award-number":["CAREER award 1053605"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000141110662"],"award-info":[{"award-number":["N000141110662"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Foundation","award":["CCF-0915681"],"award-info":[{"award-number":["CCF-0915681"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10951-016-0492-y","type":"journal-article","created":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T14:51:36Z","timestamp":1469631096000},"page":"279-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A greedy approximation algorithm for minimum-gap scheduling"],"prefix":"10.1007","volume":"20","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uriel","family":"Feige","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Taghi","family":"Hajiaghayi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjeev","family":"Khanna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seffi","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,27]]},"reference":[{"issue":"5","key":"492_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1735223.1735245","volume":"53","author":"S Albers","year":"2010","unstructured":"Albers, S. (2010). Energy-efficient algorithms. Communications of the ACM, 53(5), 86\u201396.","journal-title":"Communications of the ACM"},{"key":"492_CR2","doi-asserted-by":"crossref","unstructured":"Albers, S., & Antoniadis, A. (2012). Race to idle: New algorithms for speed scaling with a sleep state. In Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms (SODA) (pp. 1266\u20131285).","DOI":"10.1137\/1.9781611973099.100"},{"issue":"2","key":"492_CR3","first-page":"9","volume":"10","author":"S Albers","year":"2014","unstructured":"Albers, S., & Antoniadis, A. (2014). Race to idle: New algorithms for speed scaling with a sleep state. ACM Transactions on Algorithms (TALG), 10(2), 9.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"492_CR4","doi-asserted-by":"crossref","unstructured":"Baptiste, P. (2006). Scheduling unit tasks to minimize the number of idle periods: A polynomial time algorithm for offline dynamic power management. In Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithms (SODA) (pp. 364\u2013367).","DOI":"10.1145\/1109557.1109598"},{"key":"492_CR5","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Chrobak, M., & D\u00fcrr, C. (2007). Polynomial time algorithms for minimum energy scheduling. In Proceedings of the 15th annual European symposium on algorithms (ESA) (pp. 136\u2013150).","DOI":"10.1007\/978-3-540-75520-3_14"},{"issue":"3","key":"492_CR6","first-page":"26","volume":"8","author":"P Baptiste","year":"2012","unstructured":"Baptiste, P., Chrobak, M., & D\u00fcrr, C. (2012). Polynomial-time algorithms for minimum energy scheduling. ACM Transactions on Algorithms (TALG), 8(3), 26.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"492_CR7","doi-asserted-by":"crossref","unstructured":"Chretienne, P. (2008). On single-machine scheduling without intermediate delays. Discrete Applied Mathematics, 156(13), 2543\u20132550.","DOI":"10.1016\/j.dam.2008.03.010"},{"key":"492_CR8","doi-asserted-by":"crossref","unstructured":"Demaine, E. D., Ghodsi, M., Hajiaghayi, M. T., Sayedi-Roshkhar, A. S., & Zadimoghaddam, M. (2007). Scheduling to minimize gaps and power consumption. In Proceedings of the ACM symposium on parallelism in algorithms and architectures (SPAA) (pp. 46\u201354).","DOI":"10.1145\/1248377.1248385"},{"issue":"2","key":"492_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10951-012-0309-6","volume":"16","author":"ED Demaine","year":"2013","unstructured":"Demaine, E. D., Ghodsi, M., Hajiaghayi, M. T., Sayedi-Roshkhar, A. S., & Zadimoghaddam, M. (2013). Scheduling to minimize gaps and power consumption. Journal of Scheduling, 16(2), 151\u2013160.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"492_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1067309.1067324","volume":"36","author":"S Irani","year":"2005","unstructured":"Irani, S., & Pruhs, K. R. (2005). Algorithmic problems in power management. SIGACT News, 36(2), 63\u201376.","journal-title":"SIGACT News"},{"key":"492_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2015.06.012","volume":"600","author":"G Kumar","year":"2015","unstructured":"Kumar, G., & Shannigrahi, S. (2015). On the NP-hardness of speed scaling with sleep state. Theoretical Computer Science, 600, 1\u201310.","journal-title":"Theoretical Computer Science"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0492-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-016-0492-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0492-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0492-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T15:44:59Z","timestamp":1589730299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-016-0492-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,27]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["492"],"URL":"https:\/\/doi.org\/10.1007\/s10951-016-0492-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2016,7,27]]},"assertion":[{"value":"27 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}