{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T13:30:52Z","timestamp":1780061452336,"version":"3.54.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T00:00:00Z","timestamp":1450656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61221063"],"award-info":[{"award-number":["61221063"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Program for Changjiang Scholars and Innovative Research Team in University","award":["IRT1173"],"award-info":[{"award-number":["IRT1173"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10878-015-9982-7","type":"journal-article","created":{"date-parts":[[2015,12,20]],"date-time":"2015-12-20T19:38:56Z","timestamp":1450640336000},"page":"590-608","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Online MapReduce scheduling problem of minimizing the makespan"],"prefix":"10.1007","volume":"33","author":[{"given":"Cong","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuqing","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chengyu","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,12,21]]},"reference":[{"key":"9982_CR1","doi-asserted-by":"publisher","unstructured":"Chang H, Kodialam M, Kompella R, Lakshman T, Lee M, Mukherjee S (2011) Scheduling in mapreduce-like systems for fast completion time. In: INFOCOM, 2011 Proceedings IEEE, pp 3074\u20133082. doi: 10.1109\/INFCOM.2011.5935152","DOI":"10.1109\/INFCOM.2011.5935152"},{"issue":"4","key":"9982_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0167-6377(97)00040-0","volume":"21","author":"B Chen","year":"1997","unstructured":"Chen B, Vestjens A (1997) Scheduling on identical machines: how good is lpt in an on-line setting? Oper Res Lett 21(4):165\u2013169. doi: 10.1016\/S0167-6377(97)00040-0","journal-title":"Oper Res Lett"},{"key":"9982_CR3","doi-asserted-by":"publisher","unstructured":"Chen F, Kodialam M, Lakshman TV (2012) Joint scheduling of processing and shuffle phases in mapreduce systems. In: INFOCOM, 2012 Proceedings IEEE, pp 1143\u20131151. doi: 10.1109\/INFCOM.2012.6195473","DOI":"10.1109\/INFCOM.2012.6195473"},{"issue":"1","key":"9982_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113. doi: 10.1145\/1327452.1327492","journal-title":"Commun ACM"},{"issue":"5","key":"9982_CR5","doi-asserted-by":"crossref","first-page":"468","DOI":"10.2307\/2324300","volume":"100","author":"DW DeTemple","year":"1993","unstructured":"DeTemple DW (1993) A quicker convergence to euler\u2019s constant. Am Math Mon 100(5):468\u2013470","journal-title":"Am Math Mon"},{"key":"9982_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0029562","volume-title":"Online algorithms, lecture notes in computer science","author":"A Fiat","year":"1998","unstructured":"Fiat A, Woeginger G (1998) Competitive analysis of algorithms. In: Fiat A, Woeginger G (eds) Online algorithms, lecture notes in computer science, vol 1442. Springer, Berlin, pp 1\u201312. doi: 10.1007\/BFb0029562"},{"issue":"2","key":"9982_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.orl.2013.01.002","volume":"41","author":"S Guo","year":"2013","unstructured":"Guo S, Kang L (2013) Online scheduling of parallel jobs with preemption on two identical machines. Oper Res Lett 41(2):207\u2013209. doi: 10.1016\/j.orl.2013.01.002","journal-title":"Oper Res Lett"},{"key":"9982_CR8","doi-asserted-by":"publisher","unstructured":"Isard M, Prabhakaran V, Currey J, Wieder U, Talwar K, Goldberg A (2009) Quincy: fair scheduling for distributed computing clusters. In: Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles, ACM, pp 261\u2013276. doi: 10.1145\/1629575.1629601","DOI":"10.1145\/1629575.1629601"},{"key":"9982_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-015-0902-7","author":"T Luo","year":"2015","unstructured":"Luo T, Zhu Y, Wu W, Xu Y, Du DZ (2015) Online makespan minimization in mapreduce-like systems with complex reduce tasks. Optim Lett. doi: 10.1007\/s11590-015-0902-7","journal-title":"Optim Lett"},{"key":"9982_CR10","doi-asserted-by":"publisher","unstructured":"Moseley B, Dasgupta A, Kumar R, Sarl\u00f3s T (2011) On scheduling in map-reduce and flow-shops. In: Proceedings of the twenty-third annual ACM symposium on parallelism in algorithms and architectures, ACM, SPAA \u201911, pp 289\u2013298. doi: 10.1145\/1989493.1989540","DOI":"10.1145\/1989493.1989540"},{"key":"9982_CR11","volume-title":"NIST handbook of mathematical functions","author":"FW Olver","year":"2010","unstructured":"Olver FW (2010) NIST handbook of mathematical functions. Cambridge University Press, Cambridge"},{"key":"9982_CR12","doi-asserted-by":"publisher","unstructured":"Pinedo M (2012) Parallel machine models (deterministic). In: Scheduling, Springer US, pp 111\u2013149. doi: 10.1007\/978-1-4614-2361-4_5","DOI":"10.1007\/978-1-4614-2361-4_5"},{"issue":"1","key":"9982_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/2492101.1555384","volume":"37","author":"T Sandholm","year":"2009","unstructured":"Sandholm T, Lai K (2009) Mapreduce optimization using regulated dynamic prioritization. SIGMETRICS Perform Eval Rev 37(1):299\u2013310. doi: 10.1145\/2492101.1555384","journal-title":"SIGMETRICS Perform Eval Rev"},{"key":"9982_CR14","doi-asserted-by":"publisher","unstructured":"Tan J, Meng X, Zhang L (2012) Performance analysis of coupling scheduler for mapreduce\/hadoop. In: INFOCOM, 2012 Proceedings IEEE, pp 2586\u20132590. doi: 10.1109\/INFCOM.2012.6195658","DOI":"10.1109\/INFCOM.2012.6195658"},{"key":"9982_CR15","doi-asserted-by":"publisher","unstructured":"Wang W, Zhu K, Ying L, Tan J, Zhang L (2013) Map task scheduling in mapreduce with data locality: Throughput and heavy-traffic optimality. In: INFOCOM, 2013 Proceedings IEEE, pp 1609\u20131617. doi: 10.1109\/INFCOM.2013.6566957","DOI":"10.1109\/INFCOM.2013.6566957"},{"key":"9982_CR16","doi-asserted-by":"publisher","unstructured":"Yuan Y, Wang D, Liu J (2014) Joint scheduling of mapreduce jobs with servers: performance bounds and experiments. In: INFOCOM, 2014 Proceedings IEEE, pp 2175\u20132183. doi: 10.1109\/INFOCOM.2014.6848160","DOI":"10.1109\/INFOCOM.2014.6848160"},{"key":"9982_CR17","unstructured":"Zaharia M, Konwinski A, Joseph A, Katz R, Stoica I (2008) Improving mapreduce performance in heterogeneous environments. In: 8th USENIX Symposium on Operating Systems Design and Implementation (OSDI 08)"},{"key":"9982_CR18","doi-asserted-by":"publisher","unstructured":"Zaharia M, Borthakur D, Sarma JS, Elmeleegy K, Shenker S, Stoica I (2010) Delay scheduling: a simple technique for achieving locality and fairness in cluster scheduling. In: Proceedings of the 5th European conference on Computer systems, ACM, pp 265\u2013278. doi: 10.1145\/1755913.1755940","DOI":"10.1145\/1755913.1755940"},{"key":"9982_CR19","doi-asserted-by":"publisher","unstructured":"Zheng Y, Shroff N, Sinha P (2013) A new analytical technique for designing provably efficient mapreduce schedulers. In: INFOCOM, 2013 Proceedings IEEE, pp 1600\u20131608. doi: 10.1109\/INFCOM.2013.6566956","DOI":"10.1109\/INFCOM.2013.6566956"},{"key":"9982_CR20","doi-asserted-by":"publisher","unstructured":"Zhu Y, Jiang Y, Wu W, Ding L, Teredesai A, Li D, Lee W (2014) Minimizing makespan and total completion time in mapreduce-like systems. In: INFOCOM, 2014 Proceedings IEEE, pp 2166\u20132174. doi: 10.1109\/INFOCOM.2014.6848159","DOI":"10.1109\/INFOCOM.2014.6848159"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9982-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9982-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9982-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9982-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:28Z","timestamp":1559262208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9982-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,21]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["9982"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9982-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,21]]}}}