{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T02:14:06Z","timestamp":1763259246494,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319130743"},{"type":"electronic","value":"9783319130750"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-13075-0_20","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:37:06Z","timestamp":1415983026000},"page":"247-258","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Throughput Maximization in Multiprocessor Speed-Scaling"],"prefix":"10.1007","author":[{"given":"Eric","family":"Angel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evripidis","family":"Bampis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Chau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen Kim","family":"Thang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,8]]},"reference":[{"issue":"5","key":"20_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":"20_CR2","doi-asserted-by":"crossref","unstructured":"Albers, S., Antoniadis, A., Greiner, G.: On multi-processor speed scaling with migration: extended abstract. In: Proc. 23rd Annual ACM SPAA, pp. 279\u2013288. ACM (2011)","DOI":"10.1145\/1989493.1989539"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Albers, S., M\u00fcller, F., Schmelzer, S.: Speed scaling on parallel processors. In: Proc. 19th Annual ACM SPAA, pp. 289\u2013298. ACM (2007)","DOI":"10.1145\/1248377.1248424"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Angel, E., Bampis, E., Chau, V.: Throughput maximization in the speed-scaling setting. In: STACS, vol. 25. LIPIcs, pp. 53\u201362 (2014)","DOI":"10.1007\/978-3-319-13075-0_20"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-38236-9_2","volume-title":"Theory and Applications of Models of Computation","author":"E Angel","year":"2013","unstructured":"Angel, E., Bampis, E., Chau, V., Letsios, D.: Throughput Maximization for Speed-Scaling with Agreeable Deadlines. In: Chan, T.-H.H., Lau, L.C., Trevisan, L. (eds.) TAMC 2013. LNCS, vol. 7876, pp. 10\u201319. Springer, Heidelberg (2013)"},{"key":"20_CR6","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":"20_CR7","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. Scheduling 16(4), 385\u2013394 (2013)","journal-title":"J. Scheduling"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-40313-2_8","volume-title":"Mathematical Foundations of Computer Science 2013","author":"A Antoniadis","year":"2013","unstructured":"Antoniadis, A., Huang, C.-C., Ott, S., Verschae, J.: How to Pack Your Items When You Have to Buy Your Knapsack. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 62\u201373. Springer, Heidelberg (2013)"},{"key":"20_CR9","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":"20_CR10","unstructured":"Bampis, E., Kononov, A., Letsios, D., Lucarelli, G., Sviridenko, M.: Energy efficient scheduling and routing via randomized rounding. In: FSTTCS, vol. 24. LIPIcs, pp. 449\u2013460 (2013)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-35261-4_14","volume-title":"Algorithms and Computation","author":"E Bampis","year":"2012","unstructured":"Bampis, E., Letsios, D., Lucarelli, G.: Green Scheduling, Flows and Matchings. In: Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 106\u2013115. Springer, Heidelberg (2012)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-540-70575-8_34","volume-title":"Automata, Languages and Programming","author":"N Bansal","year":"2008","unstructured":"Bansal, N., Chan, H.-L., Lam, T.-W., Lee, L.-K.: Scheduling for Speed Bounded Processors. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 409\u2013420. Springer, Heidelberg (2008)"},{"key":"20_CR13","unstructured":"Brucker, P.: Scheduling Algorithms, 5th edn. Springer Publishing Company, Incorporated (2010)"},{"key":"20_CR14","unstructured":"Carr, R.D., Fleischer, L., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proc. 11th ACM-SIAM SODA, pp. 106\u2013115 (2000)"},{"key":"20_CR15","unstructured":"Chan, H.-L., Chan, W.-T., Lam, T. W., Lee, L.-K., Mak, K.-S., Wong, P.W. H.: Energy efficient online deadline scheduling. In: SODA, pp. 795\u2013804. SIAM (2007)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-18318-8_6","volume-title":"Approximation and Online Algorithms","author":"H-L Chan","year":"2011","unstructured":"Chan, H.-L., Lam, T.-W., Li, R.: Tradeoff between Energy and Throughput for Online Deadline Scheduling. In: Jansen, K., Solis-Oba, R. (eds.) WAOA 2010. LNCS, vol. 6534, pp. 59\u201370. Springer, Heidelberg (2011)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., Li, Z., Mathieu, C., Milis, I.: Energy-efficient algorithms for non-preemptive speed-scaling. Research report, arXiv:1402.4111v2 [cs.DS] (2014)","DOI":"10.1007\/978-3-319-18263-6_10"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Jain, K.: Online matching with concave returns. In: Proc. 44th ACM STOC, pp. 137\u2013144 (2012)","DOI":"10.1145\/2213977.2213992"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Greiner, G., Nonner, T., Souza, A.: The bell is ringing in speed-scaled multiprocessor scheduling. In: Proc. 21st Annual ACM SPAA, pp. 11\u201318. ACM (2009)","DOI":"10.1145\/1583991.1583996"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-662-44465-8_31","volume-title":"Mathematical Foundations of Computer Science 2014","author":"C-C Huang","year":"2014","unstructured":"Huang, C.-C., Ott, S.: New Results for Non-Preemptive Speed Scaling. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part II. LNCS, vol. 8635, pp. 360\u2013371. Springer, Heidelberg (2014)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Kling, P., Pietrzyk, P.: Profitable scheduling on multiple speed-scalable processors. In: Proc. 25th Annual ACM SPAA, pp. 251\u2013260 (2013)","DOI":"10.1145\/2486159.2486183"},{"issue":"1","key":"20_CR22","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02248588","volume":"26","author":"EL Lawler","year":"1990","unstructured":"Lawler, E.L.: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Annals of Operations Research 26(1), 125\u2013133 (1990)","journal-title":"Annals of Operations Research"},{"issue":"32","key":"20_CR23","doi-asserted-by":"publisher","first-page":"4074","DOI":"10.1016\/j.tcs.2010.10.011","volume":"412","author":"M Li","year":"2011","unstructured":"Li, M.: Approximation algorithms for variable voltage processors: Min energy, max throughput and online heuristics. Theor. Comput. Sci. 412(32), 4074\u20134080 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR24","unstructured":"Frances Yao, F., Demers, A.J., Shenker, S.: A scheduling model for reduced CPU energy. In: FOCS, pp. 374\u2013382. IEEE Computer Society (1995)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13075-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T10:20:56Z","timestamp":1675246856000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13075-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319130743","9783319130750"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13075-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}