{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:44:52Z","timestamp":1761896692232,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,12,12]],"date-time":"2017-12-12T00:00:00Z","timestamp":1513036800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000777","name":"University of Leeds","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000777","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10951-017-0552-y","type":"journal-article","created":{"date-parts":[[2017,12,12]],"date-time":"2017-12-12T03:13:20Z","timestamp":1513048400000},"page":"505-516","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Models and algorithms for energy-efficient scheduling with immediate start of jobs"],"prefix":"10.1007","volume":"21","author":[{"given":"Akiyoshi","family":"Shioura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natalia V.","family":"Shakhlevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly A.","family":"Strusevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Primas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,12]]},"reference":[{"key":"552_CR1","doi-asserted-by":"crossref","first-page":"2093","DOI":"10.1016\/j.comnet.2013.04.001","volume":"57","author":"G Aceto","year":"2013","unstructured":"Aceto, G., Botta, A., de Donato, W., & Pescap\u00e8, A. (2013). Cloud monitoring: A survey. Computer Networks, 57, 2093\u20132115.","journal-title":"Computer Networks"},{"key":"552_CR2","volume-title":"Network flows: Theory, algorithms and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms and applications. Englewood Cliffs: Prentice Hall."},{"key":"552_CR3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/978-3-642-03456-5_12","volume":"5760","author":"S Albers","year":"2009","unstructured":"Albers, S. (2009). Algorithms for energy saving. Lecture Notes in Computer Science, 5760, 173\u2013186.","journal-title":"Lecture Notes in Computer Science"},{"key":"552_CR4","doi-asserted-by":"crossref","unstructured":"Albers, S. (2010a). Energy-efficient algorithms. Communications of the ACM, 53, 86\u201396.","DOI":"10.1145\/1735223.1735245"},{"key":"552_CR5","doi-asserted-by":"crossref","unstructured":"Albers, S. (2010b). Algorithms for energy management. Lecture Notes in Computer Science, 6072, 1\u201311.","DOI":"10.1007\/978-3-642-13182-0_1"},{"key":"552_CR6","doi-asserted-by":"crossref","first-page":"49:1","DOI":"10.1145\/1290672.1290686","volume":"3","author":"S Albers","year":"2007","unstructured":"Albers, S., & Fujiwara, H. (2007). Energy-efficient algorithms for flow time minimization. ACM Transactions on Algorithms, 3, 49:1\u201349:17.","journal-title":"ACM Transactions on Algorithms"},{"key":"552_CR7","unstructured":"Albers, S., Antoniadis, A., & Geiner, G. (2011). On multiprocessor speed scaling with migration. In Proceedings of the symposium on parallelism in algorithms and architectures (SPAA) (pp. 279\u2013288)."},{"key":"552_CR8","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/s00453-012-9678-7","volume":"68","author":"S Albers","year":"2014","unstructured":"Albers, S., M\u00fcller, F., & Schmelzer, S. (2014). Speed scaling on parallel processors. Algorithmica, 68, 404\u2013425.","journal-title":"Algorithmica"},{"key":"552_CR9","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/978-3-642-32820-6_15","volume":"7484","author":"E Angel","year":"2012","unstructured":"Angel, E., Bampis, E., Kacem, F., & Letsios, D. (2012). Speed scaling on parallel processors with migration. Lecture Notes in Computer Science, 7484, 128\u2013140.","journal-title":"Lecture Notes in Computer Science"},{"key":"552_CR10","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/978-3-642-38236-9_2","volume":"7876","author":"E Angel","year":"2013","unstructured":"Angel, E., Bampis, E., Chau, V., & Letsios, D. (2013). Throughput maximization for speed-scaling with agreeable deadlines. Lecture Notes in Computer Science, 7876, 10\u201319.","journal-title":"Lecture Notes in Computer Science"},{"key":"552_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2016.03.020","volume":"630","author":"E Angel","year":"2016","unstructured":"Angel, E., Bampis, E., Chau, V., & Thang, N. K. (2016). Throughput maximization in multiprocessor speed-scaling. Theoretical Computer Science, 630, 1\u201312.","journal-title":"Theoretical Computer Science"},{"key":"552_CR12","unstructured":"Antoniadis, A., Barcelo, N., Consuegra, M., Kling, P., Nugen, M., Pruhs, K., & Scquizzatok, M. (2014). Efficient computation of optimal energy and fractional weighted flow trade-off schedules. In Proceedings of the 31st international symposium on theoretical aspects of computer science (STACS \u201914) (pp. 63\u201374)."},{"key":"552_CR13","unstructured":"Armbrust, M., Fox, A., Griffith, R., Joseph, A. D., Katz, R. H., Konwinski, A., et al. (2009). Above the clouds: A Berkeley view of cloud computing (p. 28). UCB\/EECS, vol: Technical Report, EECS Department, University of California, Berkeley."},{"key":"552_CR14","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/1721654.1721672","volume":"53","author":"M Armbrust","year":"2010","unstructured":"Armbrust, M., Fox, A., Griffith, R., Joseph, A. D., Katz, R. H., Konwinski, A., et al. (2010). A view of cloud computing. Communications of the ACM, 53, 55\u201358.","journal-title":"Communications of the ACM"},{"key":"552_CR15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-319-44914-2_1","volume":"9869","author":"E Bampis","year":"2016","unstructured":"Bampis, E. (2016). Algorithmic issues in energy-efficient computation. Lecture Notes in Computer Science, 9869, 3\u201314.","journal-title":"Lecture Notes in Computer Science"},{"key":"552_CR16","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.tcs.2015.02.020","volume":"579","author":"E Bampis","year":"2015","unstructured":"Bampis, E., Letsios, D., & Lucarelli, G. (2015). Green scheduling, flows and matchings. Theoretical Computer Science, 579, 126\u2013136.","journal-title":"Theoretical Computer Science"},{"key":"552_CR17","doi-asserted-by":"crossref","first-page":"1294","DOI":"10.1137\/08072125X","volume":"39","author":"N Bansal","year":"2010","unstructured":"Bansal, N., Pruhs, K., & Stein, C. (2010). Speed scaling for weighted flow time. SIAM Journal on Computing, 39, 1294\u20131308.","journal-title":"SIAM Journal on Computing"},{"key":"552_CR18","doi-asserted-by":"crossref","unstructured":"Barcelo, N. (2015). The complexity of speed-scaling. Ph.D. thesis, University of Pittsburgh.","DOI":"10.1007\/978-3-662-48054-0_7"},{"key":"552_CR19","first-page":"207","volume":"3","author":"N Barcelo","year":"2013","unstructured":"Barcelo, N., Cole, D., Letsios, D., Nugent, M., & Pruhs, K. (2013). Optimal energy trade-off schedules. Sustainable Computing: Informatics and Systems, 3, 207\u2013217.","journal-title":"Sustainable Computing: Informatics and Systems"},{"key":"552_CR20","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.ijpe.2007.06.004","volume":"112","author":"\u00d6B Bekki","year":"2008","unstructured":"Bekki, \u00d6. B., & Azizo\u011flu, M. (2008). Operational fixed interval scheduling problem on uniform parallel machines. International Journal of Production Economics, 112, 756\u2013768.","journal-title":"International Journal of Production Economics"},{"key":"552_CR21","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00121680","volume":"9","author":"KI Bouzina","year":"1996","unstructured":"Bouzina, K. I., & Emmons, H. (1996). Interval scheduling on identical machines. Journal of Global Optimization, 9, 379\u2013393.","journal-title":"Journal of Global Optimization"},{"key":"552_CR22","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/40.888701","volume":"20","author":"DM Brooks","year":"2000","unstructured":"Brooks, D. M., Bose, P., Schuster, S. E., Jacobson, H., Kudva, P. N., Buyuktosunoglu, A., et al. (2000). Power-aware microarchitecture: Design and modeling challenges for next-generation microprocessors. IEEE Micro, 20, 26\u201344.","journal-title":"IEEE Micro"},{"key":"552_CR23","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/s10951-009-0123-y","volume":"12","author":"DP Bunde","year":"2009","unstructured":"Bunde, D. P. (2009). Power-aware scheduling for makespan and flow. Journal of Scheduling, 12, 489\u2013500.","journal-title":"Journal of Scheduling"},{"key":"552_CR24","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0166-218X(95)80003-M","volume":"59","author":"MC Carlisle","year":"1995","unstructured":"Carlisle, M. C., & Lloyd, E. L. (1995). On the $$k$$ k -coloring of intervals. Discrete Applied Mathematics, 59, 225\u2013235.","journal-title":"Discrete Applied Mathematics"},{"key":"552_CR25","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.tcs.2012.11.021","volume":"470","author":"S-H Chan","year":"2013","unstructured":"Chan, S.-H., Lam, T.-W., & Lee, L.-K. (2013). Scheduling for weighted flow time and energy with rejection penalty. Theoretical Computer Science, 470, 93\u2013104.","journal-title":"Theoretical Computer Science"},{"key":"552_CR26","doi-asserted-by":"crossref","unstructured":"Do Lago, D.G., Madeira, E.R.M., & Bittencourt, L.F. (2011). Power-aware virtual machine scheduling on clouds using active cooling control and DVFS. In Proceedings of the 9th international workshop on middleware for grids, clouds and e-science (MGC \u201911) (pp. 1\u20136).","DOI":"10.1145\/2089002.2089004"},{"key":"552_CR27","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1016\/j.future.2012.06.006","volume":"29","author":"SK Garg","year":"2013","unstructured":"Garg, S. K., Versteeg, S., & Buyya, R. (2013). A framework for ranking of cloud computing services. Future Generation Computer Systems, 29, 1012\u20131023.","journal-title":"Future Generation Computer Systems"},{"key":"552_CR28","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10951-015-0463-8","volume":"19","author":"MET Gerards","year":"2016","unstructured":"Gerards, M. E. T., Hurink, J. L., & H\u00f6lzenspies, P. K. F. (2016). A survey of offline algorithms for energy minimization under deadline constraints. Journal of Scheduling, 19, 3\u201319.","journal-title":"Journal of Scheduling"},{"key":"552_CR29","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1109\/TC.1979.1675260","volume":"28","author":"UI Gupta","year":"1979","unstructured":"Gupta, U. I., Lee, D. T., & Leung, J. Y.-T. (1979). An optimal solution for the channel-assignment problem. IEEE Transactions on Computers, 28, 807\u2013810.","journal-title":"IEEE Transactions on Computers"},{"key":"552_CR30","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/S0305-0548(00)00086-1","volume":"29","author":"K Hiraishi","year":"2002","unstructured":"Hiraishi, K., Levner, E., & Vlach, M. (2002). Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs. Computers and Operations Research, 29, 841\u2013848.","journal-title":"Computers and Operations Research"},{"key":"552_CR31","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/978-3-642-10665-1_22","volume":"5931","author":"W Iqbal","year":"2009","unstructured":"Iqbal, W., Dailey, M., & Carrera, D. (2009). SLA-driven adaptive resource management for web applications on a heterogeneous compute cloud. Lecture Notes in Computer Science, 5931, 243\u2013253.","journal-title":"Lecture Notes in Computer Science"},{"key":"552_CR32","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s10922-014-9307-7","volume":"23","author":"B Jennings","year":"2015","unstructured":"Jennings, B., & Stadler, R. (2015). Resource management in clouds: Survey and research challenges. Journal of Network and Systems Management, 23, 567\u2013619.","journal-title":"Journal of Network and Systems Management"},{"key":"552_CR33","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s11227-011-0722-1","volume":"65","author":"S-Y Jing","year":"2013","unstructured":"Jing, S.-Y., Ali, S., She, K., & Zhong, Y. (2013). State-of-the-art research study for green cloud computing. Journal of Supercomputing, 65, 445\u2013468.","journal-title":"Journal of Supercomputing"},{"key":"552_CR34","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1002\/nav.20231","volume":"54","author":"AWJ Kolen","year":"2007","unstructured":"Kolen, A. W. J., Lenstra, J. K., Papadimitriou, C. H., & Spieksma, F. C. R. (2007). Interval scheduling: A survey. Naval Research Logistics, 54, 530\u2013543.","journal-title":"Naval Research Logistics"},{"key":"552_CR35","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.ejor.2006.01.049","volume":"178","author":"MY Kovalyov","year":"2007","unstructured":"Kovalyov, M. Y., Ng, C. T., & Cheng, T. C. E. (2007). Fixed interval scheduling: Models, applications, computational complexity and algorithms. European Journal of Operational Research, 178, 331\u2013342.","journal-title":"European Journal of Operational Research"},{"key":"552_CR36","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10842-014-0188-y","volume":"15","author":"KE Kushida","year":"2015","unstructured":"Kushida, K. E., Murray, J., & Zysman, J. (2015). Cloud computing: From scarcity to abundance. Journal of Industry, Competition and Trade, 15, 5\u201319.","journal-title":"Journal of Industry, Competition and Trade"},{"key":"552_CR37","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1007\/978-3-540-87744-8_54","volume":"5193","author":"T-W Lam","year":"2008","unstructured":"Lam, T.-W., Lee, L.-K., To, I. K. K., & Wong, P. W. H. (2008). Speed scaling functions for flow time scheduling based on active job count. Lecture Notes in Computer Science, 5193, 647\u2013659.","journal-title":"Lecture Notes in Computer Science"},{"key":"552_CR38","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s10951-009-0145-5","volume":"15","author":"TW Lam","year":"2012","unstructured":"Lam, T. W., Lee, L. K., To, I. K. K., & Wong, P. W. H. (2012). Improved multi-processor scheduling for flow time and energy. Journal of Scheduling, 15, 105\u2013116.","journal-title":"Journal of Scheduling"},{"key":"552_CR39","doi-asserted-by":"crossref","first-page":"1745","DOI":"10.1016\/S0305-0548(02)00084-9","volume":"30","author":"A Lann","year":"2003","unstructured":"Lann, A., & Mosheiov, G. (2003). A note on the maximum number of on-time jobs on parallel identical machines. Computers and Operations Research, 30, 1745\u20131749.","journal-title":"Computers and Operations Research"},{"key":"552_CR40","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10878-009-9270-5","volume":"19","author":"Y Leyvand","year":"2010","unstructured":"Leyvand, Y., Shabtay, D., Steiner, G., & Yedidsion, L. (2010). Just-in-time scheduling with controllable processing times on parallel machines. Journal of Combinatorial Optimization, 19, 347\u2013368.","journal-title":"Journal of Combinatorial Optimization"},{"key":"552_CR41","doi-asserted-by":"crossref","first-page":"3983","DOI":"10.1073\/pnas.0510886103","volume":"103","author":"M Li","year":"2006","unstructured":"Li, M., Yao, A. C., & Yao, F. F. (2006). Discrete and continuous min-energy schedules for variable voltage processors. Proceedings of the National Academy of Sciences of the United States of America, 103, 3983\u20133987.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"552_CR42","unstructured":"Li, M., Yao, F. F., & Yuan, H. (2014). An $$O(n^{2})$$ O ( n 2 ) algorithm for computing optimal continuous voltage schedules. arXiv:1408.5995v1 ."},{"key":"552_CR43","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TCC.2014.2314661","volume":"2","author":"IS Moreno","year":"2014","unstructured":"Moreno, I. S., Garraghan, P., Townend, P., & Xu, J. (2014). Analysis, modeling and simulation of workload patterns in a large-scale utility cloud. IEEE Transactions on Cloud Computing, 2, 208\u2013221.","journal-title":"IEEE Transactions on Cloud Computing"},{"key":"552_CR44","doi-asserted-by":"crossref","unstructured":"Nakajima, K., Hakimi, S. L., & Lenstra, J. K. (1982). Complexity results for scheduling tasks in fixed intervals on two types of machines. SIAM Journal on Computing, 11, 512\u2013520.","DOI":"10.1137\/0211040"},{"key":"552_CR45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2006.12.006","volume":"185","author":"M Patriksson","year":"2008","unstructured":"Patriksson, M. (2008). A survey on the continuous nonlinear resource allocation. European Journal of Operational Research, 185, 1\u201346.","journal-title":"European Journal of Operational Research"},{"key":"552_CR46","doi-asserted-by":"crossref","first-page":"38:1","DOI":"10.1145\/1367064.1367078","volume":"4","author":"K Pruhs","year":"2008","unstructured":"Pruhs, K., Uthaisombut, P., & Woeginger, G. (2008). Getting the best response for your erg. ACM Transactions on Algorithms, 4, 38:1\u201338:17.","journal-title":"ACM Transactions on Algorithms"},{"key":"552_CR47","unstructured":"Rackspace: Our 100% Network Uptime Guarantee, Resource Document. Rackspace US Inc. http:\/\/www.rackspace.co.uk\/about-us\/data-centres . Accessed December 17, 2015."},{"key":"552_CR48","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.ijpe.2011.09.011","volume":"136","author":"D Shabtay","year":"2012","unstructured":"Shabtay, D., Bensoussan, Y., & Kaspi, M. (2012). A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system. International Journal of Production Economics, 136, 67\u201374.","journal-title":"International Journal of Production Economics"},{"key":"552_CR49","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"},{"key":"552_CR50","unstructured":"Shioura, A., Shakhlevich, N.V., & Strusevich, V.A. (2015). Energy saving computational models with speed scaling via submodular optimization. In Proceedings of the 3rd international conference on green computing, technology and innovation (ICGCTI2015)"},{"key":"552_CR51","volume-title":"Optimized cloud resource management and scheduling: Theory and practices","author":"W Tian","year":"2015","unstructured":"Tian, W., & Zhao, Y. (2015). Optimized cloud resource management and scheduling: Theory and practices. Los Altos: Morgan Kaufmann."},{"key":"552_CR52","doi-asserted-by":"crossref","unstructured":"Von Laszewski, G., Wang, L., Younge, A. J., & He, X. (2009). Power-aware scheduling of virtual machines in DVFS-enabled clusters. In IEEE international conference on cluster computing and workshops (CLUSTER \u201909) (pp. 1\u201310).","DOI":"10.1109\/CLUSTR.2009.5289182"},{"key":"552_CR53","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.future.2013.06.009","volume":"37","author":"C-M Wu","year":"2014","unstructured":"Wu, C.-M., Chang, R.-S., & Chan, H.-Y. (2014). A green energy-efficient scheduling algorithm using the DVFS technique for cloud datacenters. Future Generation Computer Systems, 37, 141\u2013147.","journal-title":"Future Generation Computer Systems"},{"key":"552_CR54","doi-asserted-by":"crossref","unstructured":"Yao, F. F., Demers, A. J., & Shenker, S. (1995). A scheduling model for reduced CPU energy. In Proceedings of the 36th IEEE symposium on foundations of computer science (FOCS \u201995) (pp. 374\u2013382).","DOI":"10.1109\/SFCS.1995.492493"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0552-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0552-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0552-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T17:58:26Z","timestamp":1570471106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0552-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,12]]},"references-count":54,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["552"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0552-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2017,12,12]]}}}