{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T12:08:58Z","timestamp":1779538138780,"version":"3.53.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T00:00:00Z","timestamp":1769990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T00:00:00Z","timestamp":1769990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s12351-025-01020-1","type":"journal-article","created":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T14:02:26Z","timestamp":1770040946000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Machine covering problem in MapReduce systems with a small number of machines"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2445-9655","authenticated-orcid":false,"given":"Quanchang","family":"Zheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,2,2]]},"reference":[{"key":"1020_CR1","doi-asserted-by":"crossref","unstructured":"Chang H, Kodialam M, Kompella RR, Lakshman T, Lee M, Mukherjee S (2011) Scheduling in MapReduce-like systems for fast completion time. In: 2011 proceedings IEEE INFOCOM. IEEE, pp 3074\u20133082","DOI":"10.1109\/INFCOM.2011.5935152"},{"key":"1020_CR2","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/s10878-015-9982-7","volume":"33","author":"C Chen","year":"2017","unstructured":"Chen C, Xu Y, Zhu Y, Sun C (2017) Online MapReduce scheduling problem of minimizing the makespan. J Comb Optim 33:590\u2013608","journal-title":"J Comb Optim"},{"issue":"5","key":"1020_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0167-6377(92)90004-M","volume":"11","author":"J Csirik","year":"1992","unstructured":"Csirik J, Kellerer H, Woeginger G (1992) The exact LPT-bound for maximizing the minimum completion time. Oper Res Lett 11(5):281\u2013287","journal-title":"Oper Res Lett"},{"issue":"1","key":"1020_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","journal-title":"Commun ACM"},{"issue":"2","key":"1020_CR5","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1137\/0603019","volume":"3","author":"BL Deuermeyer","year":"1982","unstructured":"Deuermeyer BL, Friesen DK, Langston MA (1982) Scheduling to maximize the minimum processor finish time in a multiprocessor system. SIAM J Algebr Discrete Methods 3(2):190\u2013196","journal-title":"SIAM J Algebr Discrete Methods"},{"key":"1020_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107387","volume":"158","author":"J Dong","year":"2021","unstructured":"Dong J, Goebel R, Hu J, Lin G, Su B (2021) Minimizing total job completion time in MapReduce scheduling. Comput Ind Eng 158:107387","journal-title":"Comput Ind Eng"},{"key":"1020_CR7","first-page":"43","volume":"39","author":"L Epstein","year":"1999","unstructured":"Epstein L, Sgall J (1999) Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica 39:43","journal-title":"Algorithmica"},{"key":"1020_CR8","volume-title":"Computers and intractability: a guide to np-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to np-completeness. W. H. Freeman and Company, New York"},{"issue":"1","key":"1020_CR9","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/322047.322055","volume":"25","author":"T Gonzalez","year":"1978","unstructured":"Gonzalez T, Sahni S (1978) Preemptive scheduling of uniform processor systems. J ACM (JACM) 25(1):92\u2013101","journal-title":"J ACM (JACM)"},{"issue":"4","key":"1020_CR10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10878-005-4923-5","volume":"10","author":"Y Jiang","year":"2005","unstructured":"Jiang Y, Tan Z, He Y (2005) Preemptive machine covering on parallel machines. J Comb Optim 10(4):345\u2013363","journal-title":"J Comb Optim"},{"issue":"03","key":"1020_CR11","doi-asserted-by":"publisher","first-page":"1850013","DOI":"10.1142\/S0217595918500136","volume":"35","author":"Y Jiang","year":"2018","unstructured":"Jiang Y, Zhou W, Zhou P (2018) An optimal preemptive algorithm for online MapReduce scheduling on two parallel machines. Asia-Pac J Oper Res 35(03):1850013","journal-title":"Asia-Pac J Oper Res"},{"issue":"4","key":"1020_CR12","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1007\/s10878-019-00436-8","volume":"38","author":"Y Jiang","year":"2019","unstructured":"Jiang Y, Zhou P, Zhou W (2019) MapReduce machine covering problem on a small number of machines. J Comb Optim 38(4):1066\u20131076","journal-title":"J Comb Optim"},{"key":"1020_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.ins.2015.07.040","volume":"326","author":"X Li","year":"2016","unstructured":"Li X, Jiang T, Ruiz R (2016) Heuristics for periodical batch job scheduling in a MapReduce computing framework. Inf Sci 326:119\u2013133","journal-title":"Inf Sci"},{"key":"1020_CR14","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s11590-015-0902-7","volume":"11","author":"T Luo","year":"2017","unstructured":"Luo T, Zhu Y, Wu W, Xu Y, Du D-Z (2017) Online makespan minimization in MapReduce-like systems with complex reduce tasks. Optim Lett 11:271\u2013277","journal-title":"Optim Lett"},{"key":"1020_CR15","doi-asserted-by":"crossref","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, pp 289\u2013298","DOI":"10.1145\/1989493.1989540"},{"issue":"8","key":"1020_CR16","doi-asserted-by":"publisher","first-page":"5953","DOI":"10.3934\/jimo.2022201","volume":"19","author":"Z Wang","year":"2023","unstructured":"Wang Z, Zheng F, Xu Y, Liu M, Sun L (2023) Total weighted tardiness for scheduling MapReduce jobs on parallel batch machines. J Ind Manag Optim 19(8):5953\u20135968","journal-title":"J Ind Manag Optim"},{"key":"1020_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2024.110429","volume":"247","author":"X Wang","year":"2024","unstructured":"Wang X, Xu S, Zhao Y (2024) SARS: towards minimizing average coflow completion time in MapReduce systems. Comput Netw 247:110429","journal-title":"Comput Netw"},{"issue":"4","key":"1020_CR18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0167-6377(96)00055-7","volume":"20","author":"GJ Woeginger","year":"1997","unstructured":"Woeginger GJ (1997) A polynomial-time approximation scheme for maximizing the minimum machine completion time. Oper Res Lett 20(4):149\u2013154","journal-title":"Oper Res Lett"},{"key":"1020_CR19","doi-asserted-by":"crossref","unstructured":"Zheng Y, Shroff NB, Sinha P (2013) A new analytical technique for designing provably efficient MapReduce schedulers. In: 2013 proceedings IEEE INFOCOM. IEEE, pp 1600\u20131608","DOI":"10.1109\/INFCOM.2013.6566956"},{"key":"1020_CR20","doi-asserted-by":"crossref","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: IEEE INFOCOM 2014\u2014IEEE conference on computer communications. IEEE, pp 2166\u20132174","DOI":"10.1109\/INFOCOM.2014.6848159"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-025-01020-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-025-01020-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-025-01020-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T11:49:57Z","timestamp":1779536997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-025-01020-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,2]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["1020"],"URL":"https:\/\/doi.org\/10.1007\/s12351-025-01020-1","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,2]]},"assertion":[{"value":"29 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"29"}}