{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T21:23:50Z","timestamp":1772832230185,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s00453-010-9420-2","type":"journal-article","created":{"date-parts":[[2010,6,21]],"date-time":"2010-06-21T14:07:25Z","timestamp":1277129245000},"page":"507-517","source":"Crossref","is-referenced-by-count":18,"title":["Nonclairvoyant Speed Scaling for Flow and Energy"],"prefix":"10.1007","volume":"61","author":[{"given":"Ho-Leung","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeff","family":"Edmonds","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tak-Wah","family":"Lam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lap-Kei","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,6,22]]},"reference":[{"key":"9420_CR1","doi-asserted-by":"crossref","unstructured":"Albers, S., Fujiwara, H.: Energy-efficient algorithms for flow time minimization. ACM Trans. Algorithms 3(4) (2007)","DOI":"10.1145\/1290672.1290686"},{"issue":"2","key":"9420_CR2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/1639562.1639576","volume":"37","author":"L.L.H. Andrew","year":"2009","unstructured":"Andrew, L.L.H., Wierman, A., Tang, A.: Optimal speed scaling under arbitrary power functions. SIGMETRICS Perform. Eval. Rev. 37(2), 39\u201341 (2009)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"9420_CR3","unstructured":"Bansal, N., Pruhs, K., Stein, C.: Speed scaling for weighted flow time. In: ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0805\u2013813 (2007)"},{"key":"9420_CR4","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chan, H.-L., Lam, T.-W., Lee, L.-K.: Scheduling for bounded speed processors. In: International Colloquium on Automata, Languages and Programming, pp. 409\u2013420 (2008)","DOI":"10.1007\/978-3-540-70575-8_34"},{"key":"9420_CR5","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chan, H.-L., Pruhs, K.: Speed scaling with an arbitrary power function. In: ACM-SIAM Syposium on Discrete Algorithms, pp.\u00a0693\u2013701 (2009)","DOI":"10.1137\/1.9781611973068.76"},{"issue":"4","key":"9420_CR6","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/1008731.1008732","volume":"51","author":"L. Becchetti","year":"2004","unstructured":"Becchetti, L., Leonardi, S.: Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. J. ACM 51(4), 517\u2013539 (2004)","journal-title":"J. ACM"},{"issue":"3","key":"9420_CR7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.jda.2005.12.001","volume":"4","author":"L. Becchetti","year":"2006","unstructured":"Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., Pruhs, K.: Online weighted flow time and deadline scheduling. J. Discrete Algorithms 4(3), 339\u2013352 (2006)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"9420_CR8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0304-3975(99)00186-3","volume":"235","author":"J. Edmonds","year":"2000","unstructured":"Edmonds, J.: Scheduling in the dark. Theor. Comput. Sci. 235(1), 109\u2013141 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"9420_CR9","doi-asserted-by":"crossref","unstructured":"Edmonds, J., Pruhs, K.: Scalably scheduling processes with arbitrary speedup curves. In: ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0685\u2013692 (2009)","DOI":"10.1137\/1.9781611973068.75"},{"issue":"4","key":"9420_CR10","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617\u2013643 (2000)","journal-title":"J. ACM"},{"issue":"4","key":"9420_CR11","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1145\/792538.792545","volume":"50","author":"B. Kalyanasundaram","year":"2003","unstructured":"Kalyanasundaram, B., Pruhs, K.: Minimizing flow time nonclairvoyantly. J. ACM 50(4), 551\u2013567 (2003)","journal-title":"J. ACM"},{"key":"9420_CR12","doi-asserted-by":"crossref","unstructured":"Lam, T.-W., Lee, L.-K., To, I.K.K., Wong, P.W.H.: Speed scaling functions for flow time scheduling based on active job count. In: European Symposium on Algorithms, pp.\u00a0647\u2013659 (2008)","DOI":"10.1007\/978-3-540-87744-8_54"},{"issue":"1","key":"9420_CR13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(94)90151-1","volume":"130","author":"R. Motwani","year":"1994","unstructured":"Motwani, R., Phillips, S., Torng, E.: Nonclairvoyant scheduling. Theor. Comput. Sci. 130(1), 17\u201347 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9420_CR14","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/1243401.1243411","volume":"34","author":"K. Pruhs","year":"2007","unstructured":"Pruhs, K.: Competitive online scheduling for server systems. SIGMETRICS Perform. Eval. Rev. 34(4), 52\u201358 (2007)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"9420_CR15","doi-asserted-by":"crossref","unstructured":"Pruhs, K., Uthaisombut, P., Woeginger, G.J.: Getting the best response for your erg. ACM Trans. Algorithms 4(3) (2008)","DOI":"10.1145\/1367064.1367078"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s00453-010-9420-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T08:14:20Z","timestamp":1559204060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9420-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,22]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9420"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9420-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,22]]}}}