{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:28Z","timestamp":1759638928874,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319182629"},{"type":"electronic","value":"9783319182636"}],"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-18263-6_10","type":"book-chapter","created":{"date-parts":[[2015,4,22]],"date-time":"2015-04-22T14:41:38Z","timestamp":1429713698000},"page":"107-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Energy-Efficient Algorithms for Non-preemptive Speed-Scaling"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Cohen-Addad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhentao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claire","family":"Mathieu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Milis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,23]]},"reference":[{"issue":"5","key":"10_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1735223.1735245","volume":"53","author":"S Albers","year":"2010","unstructured":"Albers, S.: Energy-efficient algorithms. Commun. ACM 53(5), 86\u201396 (2010)","journal-title":"Commun. ACM"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Albers, S., Antoniadis, A., Greiner, G.: On multi-processor speed scaling with migration: extended abstract. In: SPAA 2011, pp. 279\u2013288 (2011)","DOI":"10.1145\/1989493.1989539"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Albers, S., M\u00fcller, F., Schmelzer, S.: Speed scaling on parallel processors. In: SPAA 2007, pp. 289\u2013298 (2007)","DOI":"10.1145\/1248377.1248424"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-32820-6_15","volume-title":"Euro-Par 2012 Parallel Processing","author":"E Angel","year":"2012","unstructured":"Angel, E., Bampis, E., Kacem, F., Letsios, D.: Speed scaling on parallel processors with migration. In: Kaklamanis, C., Papatheodorou, T., Spirakis, P.G. (eds.) Euro-Par 2012. LNCS, vol. 7484, pp. 128\u2013140. Springer, Heidelberg (2012)"},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10951-013-0312-6","volume":"16","author":"A Antoniadis","year":"2013","unstructured":"Antoniadis, A., Huang, C.-C.: Non-preemptive speed scaling. J. Sched. 16(4), 385\u2013394 (2013)","journal-title":"J. Sched."},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.jalgor.2004.02.003","volume":"52","author":"Y Azar","year":"2004","unstructured":"Azar, Y., Epstein, L., Richter, Y., Woeginger, G.J.: All-norm approximation algorithms. J. Algorithms 52(2), 120\u2013133 (2004)","journal-title":"J. Algorithms"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-38768-5_14","volume-title":"Computing and Combinatorics","author":"E Bampis","year":"2013","unstructured":"Bampis, E., Kononov, A., Letsios, D., Lucarelli, G., Nemparis, I.: From preemptive to non-preemptive speed-scaling scheduling. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol. 7936, pp. 134\u2013146. Springer, Heidelberg (2013)"},{"key":"10_CR8","unstructured":"Bampis, E., Kononov, A., Letsios, D., Lucarelli, G., Sviridenko, M.: Energy efficient scheduling and routing via randomized rounding. In: FSTTCS, pp. 449\u2013460 (2013)"},{"issue":"4","key":"10_CR9","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00453-009-9379-z","volume":"60","author":"N Bansal","year":"2011","unstructured":"Bansal, N., Bunde, D.P., Chan, H.-L., Pruhs, K.: Average rate speed scaling. Algorithmica 60(4), 877\u2013889 (2011)","journal-title":"Algorithmica"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.4086\/toc.2012.v008a009","volume":"8","author":"N Bansal","year":"2012","unstructured":"Bansal, N., Chan, H.-L., Katz, D., Pruhs, K.: Improved bounds for speed scaling in devices obeying the cube-root rule. Theory Comput. 8(1), 209\u2013229 (2012)","journal-title":"Theory Comput."},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/1206035.1206038","volume":"54","author":"N Bansal","year":"2007","unstructured":"Bansal, N., Kimbrel, T., Pruhs, K.: Speed scaling to manage energy and temperature. J. ACM 54(1), 3:1\u20133:39 (2007)","journal-title":"J. ACM"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., Li, Z., Mathieu, C., Milis. I.: Energy-efficient algorithms for non-preemptive speed-scaling. CoRR (2014)","DOI":"10.1007\/978-3-319-18263-6_10"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Greiner, G., Nonner, T., Souza, A.: The bell is ringing in speed-scaled multiprocessor scheduling. Theory Comput. Syst. 1\u201321 (2013)","DOI":"10.1007\/s00224-013-9477-9"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Huang, C.-C., Ott, S.: New results for non-preemptive speed scaling. Research report, Max-Planck-Institut f\u00fcr Informatik (2013)","DOI":"10.1007\/978-3-662-44465-8_31"},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46(3), 259\u2013271 (1990)","journal-title":"Math. Program."},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01202286","volume":"4","author":"E Petrank","year":"1994","unstructured":"Petrank, E.: The hardness of approximation: gap location. Comput. Complex. 4(2), 133\u2013157 (1994)","journal-title":"Comput. Complex."},{"key":"10_CR18","volume-title":"Matching Theory","author":"MD Plummer","year":"1986","unstructured":"Plummer, M.D., Lov\u00e1sz, L.: Matching Theory. Elsevier Science, New York (1986)"},{"issue":"3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"DB Shmoys","year":"1993","unstructured":"Shmoys, D.B., Tardos, \u00c9.: An approximation algorithm for the generalized assignment problem. Math. Program. 62(3), 461\u2013474 (1993)","journal-title":"Math. Program."},{"key":"10_CR20","unstructured":"Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: FOCS 1995, pp. 374\u2013382 (1995)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18263-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T16:48:23Z","timestamp":1675270103000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18263-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319182629","9783319182636"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18263-6_10","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":"23 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}