{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:51:08Z","timestamp":1725742268204},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642400469"},{"type":"electronic","value":"9783642400476"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40047-6_10","type":"book-chapter","created":{"date-parts":[[2013,7,20]],"date-time":"2013-07-20T12:18:02Z","timestamp":1374322682000},"page":"66-77","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Energy-Efficient Scheduling with Time and Processors Eligibility Restrictions"],"prefix":"10.1007","author":[{"given":"Xibo","family":"Jin","sequence":"first","affiliation":[]},{"given":"Fa","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Song","sequence":"additional","affiliation":[]},{"given":"Liya","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Zhiyong","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/2.917539","volume":"34","author":"T. Mudge","year":"2001","unstructured":"Mudge, T.: Power: A first-class architecture design constraint. Journal of Computer\u00a034(4), 52\u201358 (2001)","journal-title":"Journal of Computer"},{"key":"10_CR2","unstructured":"Aupy, G., Benoit, A., Dufoss\u00e9, F., Robert, Y.: Reclaiming the energy of a schedule: Models and algorithms. INRIA Research report RR-7598 (April 2011); Short version appeared in SPAA 2011"},{"key":"10_CR3","unstructured":"Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: Proceedings of the IEEE Symposium on Foundation of Computer Science (FOCS 1995), pp. 374\u2013382 (1995)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Ishihara, T., Yasuura, H.: Voltage scheduling problem for dynamically variable voltage processors. In: Proceeding of the International Symposium on Low Power Electronics and Design (ISLPED 1998), pp. 197\u2013202 (1998)","DOI":"10.1145\/280756.280894"},{"key":"10_CR5","unstructured":"Irani, S., Shukla, S., Gupta, R.: Algorithms for power savings. In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 37\u201346 (2003)"},{"key":"10_CR6","unstructured":"Chen, J., Kuo, W.: Multiprocessor energy-efficient scheduling for real-time jobs with different power characteristics. In: International Conference on Parallel Processing (ICPP 2005), pp. 13\u201320 (2005)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Albers, S., M\u00fcller, F., Schmelzer, S.: Speed scaling on parallel processors. In: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2007), pp. 289\u2013298 (2007)","DOI":"10.1145\/1248377.1248424"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00224-007-9070-1","volume":"43","author":"K. Pruhs","year":"2008","unstructured":"Pruhs, K., van Stee, R., Uthaisombut, P.: Speed scaling of tasks with precedence constraints. Theory of Computing System\u00a043(1), 67\u201380 (2008)","journal-title":"Theory of Computing System"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Greiner, G., Nonner, T., Souza, A.: The bell is ringing in speed-scaled multiprocessor scheduling. In: Proceedings of the 21st Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2009), pp. 11\u201318 (2009)","DOI":"10.1145\/1583991.1583996"},{"key":"10_CR10","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.\u00a07484, pp. 128\u2013140. Springer, Heidelberg (2012)"},{"key":"10_CR11","unstructured":"Srikantaiah, S., Kansal, A., Zhao, F.: Energy aware consolidation for cloud computing. In: Proceedings of the Conference on Power Aware Computing and Systems (Hotpower 2008) (2008)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Gupta, A., Im, S., Krishnaswamy, R., Moseley, B., Pruhs, K.: Scheduling heterogeneous processors isn\u2019t as easy as you think. In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 1242\u20131253 (2012)","DOI":"10.1137\/1.9781611973099.98"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.ijpe.2008.09.003","volume":"116","author":"J. Leung","year":"2008","unstructured":"Leung, J., Li, L.: Scheduling with processing set restrictions: A survey. International Journal of Production Economics\u00a0116(2), 251\u2013262 (2008)","journal-title":"International Journal of Production Economics"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511804441"},{"key":"10_CR15","unstructured":"Jin, X., Zhang, F., Song, Y., Fan, L., Liu, Z.: Energy-efficient Scheduling with Time and Processors Eligibility Restrictions. CoRR-abs\/1301.4131 (2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1301.4131"},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0377-2217(02)00914-1","volume":"156","author":"Y. Lin","year":"2004","unstructured":"Lin, Y., Li, W.: Parallel machine scheduling of machine-dependent jobs with unit-length. European Journal of Operational Research\u00a0156(1), 261\u2013266 (2004)","journal-title":"European Journal of Operational Research"},{"key":"10_CR17","unstructured":"Alon, N., Azar, Y., Woeginger, G., Yadid, T.: Approximation schemes for scheduling. In: ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), pp. 493\u2013500 (1997)"},{"issue":"2","key":"10_CR18","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.: All-norm approximation algorithms. Journal of Algorithms\u00a052(2), 120\u2013133 (2004)","journal-title":"Journal of Algorithms"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-point polynomial algorithms in convex programming. SIAM Studies in Applied Mathematics. SIAM (1994)","DOI":"10.1137\/1.9781611970791"},{"key":"10_CR20","unstructured":"Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding in bipartite graphs. In: Proceedings of the IEEE Symposium on Foundation of Computer Science (FOCS 2002), pp. 323\u2013332 (2002)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2013 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40047-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T01:08:44Z","timestamp":1587344924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40047-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642400469","9783642400476"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40047-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}