{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:11:57Z","timestamp":1725869517539},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_42","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T04:16:59Z","timestamp":1477801019000},"page":"578-592","source":"Crossref","is-referenced-by-count":2,"title":["Cost-Efficient Scheduling on Machines from the Cloud"],"prefix":"10.1007","author":[{"given":"Alexander","family":"M\u00e4cker","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Malatyali","sequence":"additional","affiliation":[]},{"given":"Friedhelm Meyer auf","family":"der Heide","sequence":"additional","affiliation":[]},{"given":"S\u00f6ren","family":"Riechers","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"key":"42_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-12691-3_3","volume-title":"Combinatorial Optimization and Applications","author":"S Abshoff","year":"2014","unstructured":"Abshoff, S., Markarian, C., Meyer auf der Heide, F.: Randomized online algorithms for set cover leasing problems. In: Zhang, Z., Wu, L., Xu, W., Du, D.-Z. (eds.) COCOA 2014. LNCS, vol. 8881, pp. 25\u201334. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-12691-3_3"},{"key":"42_CR2","unstructured":"Amazon EC2. https:\/\/aws.amazon.com\/ec2\/"},{"key":"42_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-540-72792-7_32","volume-title":"Integer Programming and Combinatorial Optimization","author":"BM Anthony","year":"2007","unstructured":"Anthony, B.M., Gupta, A.: Infrastructure leasing problems. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 424\u2013438. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-72792-7_32"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Azar, Y., Ben-Aroya, N., Devanur, N.-R., Jain, N.: Cloud scheduling with setup cost. In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2013), pp. 298\u2013304. ACM (2013)","DOI":"10.1145\/2486159.2486195"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Bunde, D.P., Leung, V.J., McCauley, S., Phillips, C.A.: Efficient scheduling to minimize calibrations. In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2013), pp. 280\u2013287. ACM (2013)","DOI":"10.1145\/2486159.2486193"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Guha, S., Khanna, S., Naor, J.: Machine minimization for scheduling jobs with interval constraints. In: Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), pp. 81\u201390. IEEE (2004)","DOI":"10.1109\/FOCS.2004.38"},{"key":"42_CR7","unstructured":"Devanur, N.R., Makarychev K., Panigrahi, D., Yaroslavtsev, G.: Online Algorithms for Machine Minimization. CoRR (2014). 1403.0486"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Fineman, T.J., Sheridan, B.: Scheduling non-unit jobs to minimize calibrations. In: Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2015), pp. 161\u2013170. ACM (2015)","DOI":"10.1145\/2755573.2755605"},{"key":"42_CR9","unstructured":"Google Cloud. https:\/\/cloud.google.com\/"},{"key":"42_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-31104-8_6","volume-title":"Structural Information and Communication Complexity","author":"P Kling","year":"2012","unstructured":"Kling, P., Meyer auf der Heide, F., Pietrzyk, P.: An algorithm for online facility leasing. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 61\u201372. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-31104-8_6"},{"key":"42_CR11","unstructured":"Lee, G., Chun, B.-G., Katz, R.H.: Heterogeneity-aware resource allocation and scheduling in the cloud. In: Proceedings of the 3rd USENIX Workshop on Hot Topics in Cloud Computing (HotCloud 2011). USENIX (2001)"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Mao, M., Humphrey, M.: A performance study on the VM startup time in the cloud. In: Proceedings of the 2012 IEEE 5th International Conference on Cloud Computing (ICCC 2012), pp. 423\u2013430. IEEE (2012)","DOI":"10.1109\/CLOUD.2012.103"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Mao, M., Li, J., Humphrey, M.: Cloud auto-scaling with deadline and budget constraints. In: Proceedings of the 2010 11th IEEE\/ACM International Conference on Grid Computing (GRID 2010), pp. 41\u201348. IEEE (2010)","DOI":"10.1109\/GRID.2010.5697966"},{"key":"42_CR14","unstructured":"M\u00e4cker, A., Malatyali, M., Meyer auf der Heide, F., Riechers, S.: Cost-Efficient Scheduling on Machines from the Cloud. CoRR (2016). 1609.01184"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Meyerson, A.: The parking permit problem. In: Proceedings of the 46th Annual Symposium on Foundations of Computer Science (FOCS 2005), pp. 274\u2013282. IEEE (2005)","DOI":"10.1109\/SFCS.2005.72"},{"issue":"4","key":"42_CR16","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4), 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"42_CR17","unstructured":"Saha, B.: Renting a cloud. In: Proceedings of the Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), pp. 437\u2013448. LIPIcs (2013)"},{"key":"42_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-319-08019-2_38","volume-title":"Language, Life, Limits","author":"J Sgall","year":"2014","unstructured":"Sgall, J.: Online bin packing: old algorithms and new results. In: Beckmann, A., Csuhaj-Varj\u00fa, E., Meer, K. (eds.) CiE 2014. LNCS, vol. 8493, pp. 362\u2013372. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-08019-2_38"},{"issue":"2","key":"42_CR19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.orl.2009.01.008","volume":"37","author":"G Yu","year":"2009","unstructured":"Yu, G., Zhang, G.: Scheduling with a minimum number of machines. Oper. Res. Lett. 37(2), 97\u2013101 (2009)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T22:24:37Z","timestamp":1498343077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}