{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T19:48:20Z","timestamp":1774727300452,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T00:00:00Z","timestamp":1771545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T00:00:00Z","timestamp":1771545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natrual Science Foundation of China","doi-asserted-by":"crossref","award":["12271098"],"award-info":[{"award-number":["12271098"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10878-026-01391-x","type":"journal-article","created":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T12:30:55Z","timestamp":1771590655000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for Parallel Batch Machine Scheduling of Malleable Jobs"],"prefix":"10.1007","volume":"51","author":[{"given":"Fenghe","family":"Xia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2891-4253","authenticated-orcid":false,"given":"Longkun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,20]]},"reference":[{"issue":"3","key":"1391_CR1","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1016\/j.ejor.2006.11.047","volume":"189","author":"B Chen","year":"2008","unstructured":"Chen B, Lee CY (2008) Logistics scheduling with batching and transportation. Eur J Oper Res 189(3):871\u2013876","journal-title":"Eur J Oper Res"},{"issue":"7","key":"1391_CR2","doi-asserted-by":"publisher","first-page":"3161","DOI":"10.1016\/j.apm.2011.09.061","volume":"36","author":"B Cheng","year":"2012","unstructured":"Cheng B, Yang S, Hu X, Chen B (2012) Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes. Appl Math Model 36(7):3161\u20133167","journal-title":"Appl Math Model"},{"issue":"5","key":"1391_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1002\/nav.21587","volume":"61","author":"G Dosa","year":"2014","unstructured":"Dosa G, Tan Z, Tuza Z, Yan Y, L\u00e1nyi CS (2014) Improved bounds for batch scheduling with nonidentical job sizes. Naval Research Logistics (NRL) 61(5):351\u2013358","journal-title":"Naval Research Logistics (NRL)"},{"issue":"1","key":"1391_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2021.06.012","volume":"298","author":"JW Fowler","year":"2022","unstructured":"Fowler JW, M\u00f6nch L (2022) A survey of scheduling with parallel batch (p-batch) processing. Eur J Oper Res 298(1):1\u201324","journal-title":"Eur J Oper Res"},{"key":"1391_CR5","doi-asserted-by":"crossref","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Annals of discrete mathematics, vol.\u00a05, pp. 287\u2013326. Elsevier","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"12","key":"1391_CR6","doi-asserted-by":"publisher","first-page":"3511","DOI":"10.1109\/TPDS.2017.2731843","volume":"28","author":"L Guo","year":"2017","unstructured":"Guo L, Shen H (2017) Efficient approximation algorithms for the bounded flexible scheduling problem in clouds. IEEE Trans Parallel Distrib Syst 28(12):3511\u20133520","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"1391_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2742343","volume":"2","author":"N Jain","year":"2015","unstructured":"Jain N, Menache I, Naor J, Yaniv J (2015) Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters. ACM Transactions on Parallel Computing (TOPC) 2(1):1\u201329","journal-title":"ACM Transactions on Parallel Computing (TOPC)"},{"issue":"4","key":"1391_CR8","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"CY Lee","year":"1992","unstructured":"Lee CY, Uzsoy R, Martin-Vega LA (1992) Efficient algorithms for scheduling semiconductor burn-in operations. Oper Res 40(4):764\u2013775","journal-title":"Oper Res"},{"issue":"6","key":"1391_CR9","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.4304\/jsw.7.6.1203-1210","volume":"7","author":"S Li","year":"2012","unstructured":"Li S (2012) Makespan minimization on parallel batch processing machines with release times and job sizes. J Softw 7(6):1203\u20131210","journal-title":"J Softw"},{"issue":"3","key":"1391_CR10","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1016\/j.ejor.2017.06.021","volume":"263","author":"S Li","year":"2017","unstructured":"Li S (2017) Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities. Eur J Oper Res 263(3):815\u2013826","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1391_CR11","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1016\/j.ejor.2023.04.019","volume":"310","author":"J Ou","year":"2023","unstructured":"Ou J, Lu L, Zhong X (2023) Parallel-batch scheduling with rejection: Structural properties and approximation algorithms. Eur J Oper Res 310(3):1017\u20131032","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1391_CR12","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts CN, Kovalyov MY (2000) Scheduling with batching: A review. Eur J Oper Res 120(2):228\u2013249","journal-title":"Eur J Oper Res"},{"issue":"7","key":"1391_CR13","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy R (1994) Scheduling a single batch processing machine with non-identical job sizes. The International Journal of Production Research 32(7):1615\u20131635","journal-title":"The International Journal of Production Research"},{"issue":"6","key":"1391_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3342103","volume":"52","author":"C Wu","year":"2019","unstructured":"Wu C, Buyya R, Ramamohanarao K (2019) Cloud pricing models: Taxonomy, survey, and interdisciplinary challenges. ACM Computing Surveys (CSUR) 52(6):1\u201336","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"1","key":"1391_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ejor.2023.02.044","volume":"310","author":"X Wu","year":"2023","unstructured":"Wu X, Loiseau P (2023) Efficient approximation algorithms for scheduling moldable tasks. Eur J Oper Res 310(1):71\u201383","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1391_CR16","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1002\/nav.4","volume":"48","author":"G Zhang","year":"2001","unstructured":"Zhang G, Cai X, Lee CY, Wong CK (2001) Minimizing makespan on a single batch processing machine with nonidentical job sizes. Naval Research Logistics (NRL) 48(3):226\u2013240","journal-title":"Naval Research Logistics (NRL)"},{"key":"1391_CR17","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.knosys.2016.10.026","volume":"116","author":"R Zhang","year":"2017","unstructured":"Zhang R, Chang PC, Song S, Wu C (2017) A multi-objective artificial bee colony algorithm for parallel batch-processing machine scheduling in fabric dyeing processes. Knowl-Based Syst 116:114\u2013129","journal-title":"Knowl-Based Syst"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01391-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-026-01391-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01391-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T18:59:35Z","timestamp":1774724375000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-026-01391-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,20]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["1391"],"URL":"https:\/\/doi.org\/10.1007\/s10878-026-01391-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,20]]},"assertion":[{"value":"15 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There are no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"20"}}