{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:23:54Z","timestamp":1759335834720,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181721"},{"type":"electronic","value":"9783319181738"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18173-8_8","type":"book-chapter","created":{"date-parts":[[2015,5,15]],"date-time":"2015-05-15T08:47:43Z","timestamp":1431679663000},"page":"114-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Scheduling with Gaps: New Models and Algorithms"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mordecai","family":"Golin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tak-Wah","family":"Lam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorian","family":"Nogneng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,16]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-29344-3_2","volume-title":"LATIN 2012: Theoretical Informatics","author":"E Angel","year":"2012","unstructured":"Angel, E., Bampis, E., Chau, V.: Low complexity scheduling algorithm minimizing the energy for tasks with agreeable deadlines. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 13\u201324. Springer, Heidelberg (2012)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Baptiste, P.: 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 (2006)","DOI":"10.1145\/1109557.1109598"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-75520-3_14","volume-title":"Algorithms \u2013 ESA 2007","author":"P Baptiste","year":"2007","unstructured":"Baptiste, P., Chrobak, M., D\u00fcrr, C.: Polynomial time algorithms for minimum energy scheduling. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 136\u2013150. Springer, Heidelberg (2007)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-38233-8_9","volume-title":"Algorithms and Complexity","author":"M Chrobak","year":"2013","unstructured":"Chrobak, M., Feige, U., Taghi Hajiaghayi, M., Khanna, S., Li, F., Naor, S.: A greedy approximation algorithm for minimum-gap scheduling. In: Spirakis, P.G., Serna, M. (eds.) CIAC 2013. LNCS, vol. 7878, pp. 97\u2013109. Springer, Heidelberg (2013)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Golin, M.J., Lam, T.-W., Nogneng, D.: Scheduling with gaps: New models and algorithms. CoRR, abs\/1410.7092 (2014)","DOI":"10.1007\/978-3-319-18173-8_8"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Demaine, E., Ghodsi, M., Hajiaghayi, M., Sayedi-Roshkhar, A., Zadimoghaddam, M.: Scheduling to minimize gaps and power consumption. In: Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 46\u201354 (2007)","DOI":"10.1145\/1248377.1248385"},{"issue":"2","key":"8_CR7","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.: Algorithmic problems in power management. SIGACT News 36(2), 63\u201376 (2005)","journal-title":"SIGACT News"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0020-0190(85)90123-1","volume":"20","author":"A Mirzaian","year":"1985","unstructured":"Mirzaian, A., Arjomandi, E.: Selection in X+Y and matrices with sorted rows and columns. Inf. Process. Lett. 20(1), 13\u201317 (1985)","journal-title":"Inf. Process. Lett."},{"key":"8_CR9","unstructured":"Wikipedia. Point coordination function. http:\/\/en.wikipedia.org\/wiki\/Point_coordination_function"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0167-6377(00)00041-9","volume":"27","author":"G Woeginger","year":"2000","unstructured":"Woeginger, G.: Monge strikes again: optimal placement of web proxies in the internet. Oper. Res. Lett. 27(3), 93\u201396 (2000)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18173-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T08:55:37Z","timestamp":1676451337000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18173-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181721","9783319181738"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18173-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}