{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:27:17Z","timestamp":1759847237415},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642380150"},{"type":"electronic","value":"9783642380167"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38016-7_17","type":"book-chapter","created":{"date-parts":[[2013,4,30]],"date-time":"2013-04-30T17:58:58Z","timestamp":1367344738000},"page":"201-214","source":"Crossref","is-referenced-by-count":8,"title":["Algorithms for Cost-Aware Scheduling"],"prefix":"10.1007","author":[{"given":"Janardhan","family":"Kulkarni","sequence":"first","affiliation":[]},{"given":"Kamesh","family":"Munagala","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-03456-5_12","volume-title":"Efficient Algorithms","author":"S. Albers","year":"2009","unstructured":"Albers, S.: Algorithms for energy saving. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Festschrift Mehlhorn. LNCS, vol.\u00a05760, pp. 173\u2013186. Springer, Heidelberg (2009)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Albers, S., Fujiwara, H.: Energy-efficient algorithms for flow time minimization. ACM Transactions on Algorithms\u00a03(4) (2007)","DOI":"10.1145\/1290672.1290686"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chan, H.-L., Pruhs, K.: Speed scaling with an arbitrary power function. In: SODA (2009)","DOI":"10.1137\/1.9781611973068.76"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chan, H.-L., Pruhs, K.: Competitive algorithms for due date scheduling. Algorithmica\u00a059(4) (2011)","DOI":"10.1007\/s00453-009-9321-4"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Bansal, N., Kimbrel, T., Pruhs, K.: Speed scaling to manage energy and temperature. J. ACM 54(1) (2007)","DOI":"10.1145\/1206035.1206038"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Bansal, N., Pruhs, K.: Server scheduling in the l p norm: A rising tide lifts all boat. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC (2003)","DOI":"10.1145\/780542.780580"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Bansal, N., Pruhs, K., Stein, C.: Speed scaling for weighted flow time. In: SODA (2007)","DOI":"10.1007\/978-0-387-30162-4_390"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/3-540-44666-4_8","volume-title":"Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques","author":"L. Becchetti","year":"2001","unstructured":"Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., Pruhs, K.R.: Online weighted flow time and deadline scheduling. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX-RANDOM 2001. LNCS, vol.\u00a02129, pp. 36\u201347. Springer, Heidelberg (2001)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Chadha, J.S., Garg, N., Kumar, A., Muralidhara, V.N.: A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation. In: STOC (2009)","DOI":"10.1145\/1536414.1536506"},{"key":"17_CR10","unstructured":"Chase, J.: Demand response for computing centers, http:\/\/www.cs.duke.edu\/~chase\/dr.pdf"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-13036-6_18","volume-title":"Integer Programming and Combinatorial Optimization","author":"L. Epstein","year":"2010","unstructured":"Epstein, L., Levin, A., Marchetti-Spaccamela, A., Megow, N., Mestre, J., Skutella, M., Stougie, L.: Universal sequencing on a single machine. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol.\u00a06080, pp. 230\u2013243. Springer, Heidelberg (2010)"},{"key":"17_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: SODA (2012)","DOI":"10.1137\/1.9781611973099.98"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-14165-2_27","volume-title":"Automata, Languages and Programming","author":"A. Gupta","year":"2010","unstructured":"Gupta, A., Krishnaswamy, R., Pruhs, K.: Scalably scheduling power-heterogeneous processors. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part I. LNCS, vol.\u00a06198, pp. 312\u2013323. Springer, Heidelberg (2010)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Hall, L.A., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: Off-line and on-line algorithms. In: SODA (1996)","DOI":"10.1287\/moor.22.3.513"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Im, S., Moseley, B., Pruhs, K.: A tutorial on amortized local competitiveness in online scheduling. SIGACT News 42(2) (2011)","DOI":"10.1145\/1998037.1998058"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Im, S., Moseley, B., Pruhs, K.: Online scheduling with general cost functions. In: SODA (2012)","DOI":"10.1137\/1.9781611973099.99"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Irani, S., Shukla, S., Gupta, R.: Algorithms for power savings. ACM Trans. Algorithms\u00a03(4) (November 2007)","DOI":"10.1145\/1290672.1290678"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM\u00a047 (July 2000)","DOI":"10.1145\/347476.347479"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/978-3-642-02927-1_55","volume-title":"Automata, Languages and Programming","author":"T.-W. Lam","year":"2009","unstructured":"Lam, T.-W., Lee, L.-K., Ting, H.-F., To, I.K.K., Wong, P.W.H.: Sleep with guilt and work faster to minimize flow plus energy. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 665\u2013676. Springer, Heidelberg (2009)"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Murugesan, S.: Harnessing green it: Principles and practices. IT Professional\u00a010(1) (2008)","DOI":"10.1109\/MITP.2008.10"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Pruhs, K.: Green computing algorithmics. In: FOCS, pp. 3\u20134 (2011)","DOI":"10.1109\/FOCS.2011.44"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-15369-3_27","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"K. Pruhs","year":"2010","unstructured":"Pruhs, K., Stein, C.: How to schedule when you have to buy your energy. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX and RANDOM 2010. LNCS, vol.\u00a06302, pp. 352\u2013365. Springer, Heidelberg (2010)"},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1367064.1367078","volume":"4","author":"K. Pruhs","year":"2008","unstructured":"Pruhs, K., Uthaisombut, P., Woeginger, G.: Getting the best response for your erg. ACM Trans. Algorithms\u00a04, 38:1\u201338:17 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Qureshi, A., Weber, R., Balakrishnan, H., Guttag, J., Maggs, B.: Cutting the electric bill for internet-scale systems. In: SIGCOMM (2009)","DOI":"10.1145\/1592568.1592584"},{"key":"17_CR25","unstructured":"Electricity rates, http:\/\/www.pge.com\/tariffs\/electric.shtml"},{"key":"17_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121","author":"G. Schmidt","year":"1998","unstructured":"Schmidt, G.: Scheduling with limited machine availability. European Journal of Operational Research\u00a0121, 1\u201315 (1998)","journal-title":"European Journal of Operational Research"},{"key":"17_CR27","unstructured":"Official\u00a0Statistics. United States Department\u00a0of Energy, http:\/\/www.eia.doe.gov"},{"key":"17_CR28","unstructured":"Yao, F.F., Demers, A.J., Shenker, S.: A scheduling model for reduced cpu energy. In: FOCS (1995)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38016-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T14:17:53Z","timestamp":1644934673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38016-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642380150","9783642380167"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38016-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}