{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T11:32:01Z","timestamp":1774870321033,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2009,7,29]],"date-time":"2009-07-29T00:00:00Z","timestamp":1248825600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s10951-009-0123-y","type":"journal-article","created":{"date-parts":[[2009,7,28]],"date-time":"2009-07-28T20:17:08Z","timestamp":1248812228000},"page":"489-500","source":"Crossref","is-referenced-by-count":39,"title":["Power-aware scheduling for makespan and flow"],"prefix":"10.1007","volume":"12","author":[{"given":"David P.","family":"Bunde","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,7,29]]},"reference":[{"key":"123_CR1","unstructured":"Advanced Micro Devices. (2004). AMD Athlon 64 processor power and thermal data sheet (version 3.43), October 2004. http:\/\/www.amd.com\/us-en\/assets\/content_type\/white_papers_and_tech_docs\/30430.pdf ."},{"key":"123_CR2","doi-asserted-by":"crossref","unstructured":"Albers, S., & Fujiwara, H. (2006). Energy-efficient algorithms for flow time minimization. In Proceedings of the 23rd international symposium on theoretical aspects of computer science (pp. 621\u2013633).","DOI":"10.1007\/11672142_51"},{"key":"123_CR3","doi-asserted-by":"crossref","unstructured":"Albers, S., M\u00fcller, F., & Schmelzer, S. (2007). Speed scaling on parallel processors. In Proceedings of the 19th annual ACM symposium on parallelism in algorithms and architectures (pp. 289\u2013298).","DOI":"10.1145\/1248377.1248424"},{"key":"123_CR4","unstructured":"Alon, N., Azar, Y., Woeginger, G. J., & Yadid, T. (1997). Approximation schemes for scheduling. In Proceedings of the 8th annual ACM-SIAM symposium on discrete algorithms (pp. 493\u2013500)."},{"key":"123_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF02187906","volume":"3","author":"C. Bajaj","year":"1988","unstructured":"Bajaj, C. (1988). The algebraic degree of geometric optimization problems. Discrete Comput. Geom., 3, 177\u2013191.","journal-title":"Discrete Comput. Geom."},{"key":"123_CR6","unstructured":"Bansal, N., Pruhs, K., & Stein, C. (2007). Speed scaling for weighted flow time. In Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms (pp. 805\u2013813)."},{"issue":"6","key":"123_CR7","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/40.888701","volume":"20","author":"D. M. Brooks","year":"2000","unstructured":"Brooks, D. M., Bose, P., Schuster, S. E., Jacobson, H., Kudva, P. N., Buyuktosunoglu, A., Wellman, J.-D., Zyuban, V., Gupta, M., & Cook, P. W. (2000). Power-aware microarchitecture: Design and modeling challenges for next-generation microprocessors. IEEE Micro, 20(6), 26\u201344.","journal-title":"IEEE Micro"},{"key":"123_CR8","doi-asserted-by":"crossref","unstructured":"Bunde, D. P. (2006). Power-aware scheduling for makespan and flow. In Proceedings of the 18th annual ACM symposium on parallelism in algorithms and architectures (pp. 190\u2013196).","DOI":"10.1145\/1148109.1148140"},{"key":"123_CR9","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1006\/jagm.2001.1184","volume":"41","author":"C. Chekuri","year":"2001","unstructured":"Chekuri, C., & Bender, M. A. (2001). An efficient approximation algorithm for minimizing makespan on uniformly related machines. Journal of Algorithms, 41, 212\u2013224.","journal-title":"Journal of Algorithms"},{"key":"123_CR10","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/11534273_30","volume-title":"Proceedings of the 9th workshop on algorithms and data structures","author":"J.-J. Chen","year":"2005","unstructured":"Chen, J.-J., Kuo, T.-W., & Lu, H.-I. (2005). Power-saving scheduling for weakly dynamic voltage scaling devices. In Lecture notes in computer science: Vol. 3608. Proceedings of the 9th workshop on algorithms and data structures (pp. 338\u2013349). Berlin: Springer."},{"key":"123_CR11","unstructured":"Chudak, F. A., & Shmoys, D. B. (1997). Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds. In Proceedings of the 8th annual ACM-SIAM symposium on discrete algorithms (pp. 581\u2013590)."},{"key":"123_CR12","volume-title":"Abstract algebra","author":"D. S. Dummit","year":"1991","unstructured":"Dummit, D. S., & Foote, R. M. (1991). Abstract algebra. Englewood Cliffs: Prentice-Hall."},{"key":"123_CR13","doi-asserted-by":"crossref","unstructured":"El Gamal, A., Nair, C., Prabhakar, B., Uysal-Biyikoglu, E., & Zahedi, S. (2002). Energy-efficient scheduling of packet transmissions over wireless networks. In Proceedings of the IEEE INFOCOM (pp. 1773\u20131782).","DOI":"10.1109\/INFCOM.2002.1019431"},{"key":"123_CR14","unstructured":"GAP Group. (2006). GAP system for computational discrete algebra. http:\/\/turnbull.mcs.st-and.ac.uk\/~gap\/ (viewed January 2006)."},{"key":"123_CR15","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman."},{"issue":"2","key":"123_CR16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/1067309.1067324","volume":"32","author":"S. Irani","year":"2005","unstructured":"Irani, S., & Pruhs, K. R. (2005). Algorithmic problems in power management. SIGACT News, 32(2), 63\u201376.","journal-title":"SIGACT News"},{"key":"123_CR17","unstructured":"Keslassy, I., Kodialam, M., & Lakshman, T. V. (2003). Faster algorithms for minimum-energy scheduling of wireless data transmissions. In Proceedings of the modeling and optimization in mobile, ad hoc and wireless networks."},{"issue":"4","key":"123_CR18","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/2.917539","volume":"34","author":"T. Mudge","year":"2001","unstructured":"Mudge, T. (2001). Power: A first-class architectural design constraint. Computer, 34(4), 52\u201358.","journal-title":"Computer"},{"key":"123_CR19","series-title":"Springer series in operations research","volume-title":"Planning and scheduling in manufacturing and services","author":"M. L. Pinedo","year":"2005","unstructured":"Pinedo, M. L. (2005). Planning and scheduling in manufacturing and services. Springer series in operations research. New York: Springer."},{"key":"123_CR20","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/978-3-540-27810-8_3","volume-title":"Proceedings of the 9th Scandinavian workshop on algorithm theory","author":"K. Pruhs","year":"2004","unstructured":"Pruhs, K., Uthaisombut, P., & Woeginger, G. (2004). Getting the best response for your erg. In Lecture notes in computer science: Vol. 3111. Proceedings of the 9th Scandinavian workshop on algorithm theory (pp. 14\u201325). Berlin: Springer."},{"key":"123_CR21","series-title":"Lecture notes in computer science","first-page":"307","volume-title":"Proceedings of the 3rd workshop on approximation and online algorithms","author":"K. Pruhs","year":"2005","unstructured":"Pruhs, K., van Stee, R., & Uthaisombut, P. (2005). Speed scaling of tasks with precedence constraints. In Lecture notes in computer science: Vol. 3879. Proceedings of the 3rd workshop on approximation and online algorithms (pp. 307\u2013319). Berlin: Springer."},{"key":"123_CR22","volume-title":"Real and complex analysis","author":"W. Rudin","year":"1987","unstructured":"Rudin, W. (1987). Real and complex analysis (3rd ed.) New York: McGraw-Hill.","edition":"3"},{"key":"123_CR23","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.ejor.2004.12.008","volume":"173","author":"D. Shabtay","year":"2006","unstructured":"Shabtay, D., & Kaspi, M. (2006). Parallel machine scheduling with a convex resource consumption function. European Journal of Operational Research, 173, 92\u2013107.","journal-title":"European Journal of Operational Research"},{"key":"123_CR24","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D. Shabtay","year":"2007","unstructured":"Shabtay, D., & Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155, 1643\u20131666.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"123_CR25","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s10951-005-6813-1","volume":"8","author":"N. V. Shakhlevich","year":"2005","unstructured":"Shakhlevich, N. V., & Strusevich, V. A. (2005). Pre-emptive scheduling problems with controllable processing times. Journal of Scheduling, 8(3), 233\u2013253.","journal-title":"Journal of Scheduling"},{"key":"123_CR26","doi-asserted-by":"crossref","first-page":"2178","DOI":"10.1016\/j.dam.2005.04.014","volume":"154","author":"N. V. Shakhlevich","year":"2006","unstructured":"Shakhlevich, N. V., & Strusevich, V. A. (2006). Single machine scheduling with controllable release and processing parameters. Discrete Applied Mathematics, 154, 2178\u20132199.","journal-title":"Discrete Applied Mathematics"},{"key":"123_CR27","doi-asserted-by":"crossref","unstructured":"Tiwari, V., Singh, D., Rajgopal, S., Mehta, G., Patel, R., & Baez, F. (1998). Reducing power in high-performance microprocessors. In Proceedings of the 35th ACM\/IEEE design automation conference (pp. 732\u2013737).","DOI":"10.1145\/277044.277227"},{"issue":"12","key":"123_CR28","doi-asserted-by":"crossref","first-page":"3081","DOI":"10.1109\/TIT.2004.838355","volume":"50","author":"E. Uysal-Biyikoglu","year":"2004","unstructured":"Uysal-Biyikoglu, E., & El Gamal, A. (2004). On adaptive transmission for energy efficiency in wireless data networks. IEEE Transactions on Information Theory, 50(12), 3081\u20133094.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"123_CR29","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1109\/TNET.2002.801419","volume":"10","author":"E. Uysal-Biyikoglu","year":"2002","unstructured":"Uysal-Biyikoglu, E., Prabhakar, B., & El Gamal, A. (2002). Energy-efficient packet transmission over a wireless link. IEEE\/ACM Transactions on Networking, 10(4), 487\u2013499.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"123_CR30","unstructured":"Weiser, M., Welch, B., Demers, A., & Shenker, S. (1994). Scheduling for reduced CPU energy. In Proceedings of the 1st symposium on operating systems design and implementation (pp. 13\u201323)."},{"key":"123_CR31","doi-asserted-by":"crossref","unstructured":"Xie, F., Martonosi, M., & Malik, S. (2003). Compile-time dynamic voltage scaling settings: Opportunities and limits. In Proceedings of the 2003 ACM SIGPLAN conference on programming language design and implementation (pp. 49\u201362).","DOI":"10.1145\/781131.781138"},{"key":"123_CR32","doi-asserted-by":"crossref","unstructured":"Yao, F., Demers, A., & Shenker, S. (1995). A scheduling model for reduced CPU energy. In Proceedings of the 36th symposium on foundations of computer science (pp. 374\u2013382).","DOI":"10.1109\/SFCS.1995.492493"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0123-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0123-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0123-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:43Z","timestamp":1559468383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0123-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,29]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["123"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0123-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,29]]}}}