{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T05:38:49Z","timestamp":1772775529489,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T00:00:00Z","timestamp":1717804800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T00:00:00Z","timestamp":1717804800000},"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 Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52105529"],"award-info":[{"award-number":["52105529"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52075453"],"award-info":[{"award-number":["52075453"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71931007"],"award-info":[{"award-number":["71931007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["ZYTS24049"],"award-info":[{"award-number":["ZYTS24049"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s00291-024-00770-2","type":"journal-article","created":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T08:01:34Z","timestamp":1717833694000},"page":"105-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mixed batch scheduling with non-identical job sizes to minimize makespan"],"prefix":"10.1007","volume":"47","author":[{"given":"Guo-Qiang","family":"Fan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5244-6483","authenticated-orcid":false,"given":"Jun-Qiang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhixin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,8]]},"reference":[{"issue":"19","key":"770_CR1","doi-asserted-by":"publisher","first-page":"4211","DOI":"10.1080\/00207540410001711863","volume":"42","author":"P-Y Chang","year":"2004","unstructured":"Chang P-Y, Damodaran P, Melouk S (2004) Minimizing makespan on parallel batch processing machines. Int J Prod Res 42(19):4211\u20134220","journal-title":"Int J Prod Res"},{"issue":"11","key":"770_CR2","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1080\/15458830.1996.11770748","volume":"28","author":"TCE Cheng","year":"1996","unstructured":"Cheng TCE, Chen Z-L, Kovalyov MY, Lin BMT (1996) Parallel-machine batching and scheduling to minimize total completion time. IIE Trans 28(11):953\u2013956","journal-title":"IIE Trans"},{"issue":"1","key":"770_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF02248589","volume":"26","author":"EG Coffman","year":"1990","unstructured":"Coffman EG, Yannakakis M, Magazine MJ, Santos C (1990) Batch sizing and job sequencing on a single machine. Ann Oper Res 26(1):135\u2013147","journal-title":"Ann Oper Res"},{"key":"770_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2013.09.007","volume":"510","author":"G D\u00f3sa","year":"2013","unstructured":"D\u00f3sa G, Li R, Han X, Tuza Z (2013) Tight absolute bound for first fit decreasing bin-packing: Ffd(l)$$\\le$$ 11\/9 opt (l)+ 6\/9. Theor Comput Sci 510:13\u201361","journal-title":"Theor Comput Sci"},{"issue":"5","key":"770_CR5","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1002\/nav.21587","volume":"61","author":"G D\u00f3sa","year":"2014","unstructured":"D\u00f3sa G, Tan Z, Tuza Z, Yan Y, L\u00e1nyi CS (2014) Improved bounds for batch scheduling with nonidentical job sizes. Naval Res Logist 61(5):351\u2013358","journal-title":"Naval Res Logist"},{"issue":"1","key":"770_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1080\/00207543.2020.1820095","volume":"61","author":"G-Q Fan","year":"2023","unstructured":"Fan G-Q, Wang J-Q, Liu Z (2023) Two-agent scheduling on mixed batch machines to minimise the total weighted Makespan. Int J Prod Res 61(1):237\u2013256","journal-title":"Int J Prod Res"},{"issue":"1","key":"770_CR7","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":"770_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"issue":"5","key":"770_CR9","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s10951-020-00656-5","volume":"23","author":"C He","year":"2020","unstructured":"He C, Xu C, Lin H (2020) Serial-batching scheduling with two agents to minimize Makespan and maximum cost. J Sched 23(5):609\u2013617","journal-title":"J Sched"},{"issue":"3","key":"770_CR10","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.ejor.2014.07.039","volume":"240","author":"Z-H Jia","year":"2015","unstructured":"Jia Z-H, Leung JY-T (2015) A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes. Eur J Oper Res 240(3):649\u2013665","journal-title":"Eur J Oper Res"},{"issue":"4","key":"770_CR11","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1016\/j.cor.2006.07.005","volume":"35","author":"AH Kashan","year":"2008","unstructured":"Kashan AH, Karimi B, Jenabi M (2008) A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes. Comput Oper Res 35(4):1084\u20131098","journal-title":"Comput Oper Res"},{"issue":"4","key":"770_CR12","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"C-Y Lee","year":"1992","unstructured":"Lee C-Y, 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":"3","key":"770_CR13","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":"1","key":"770_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.ejor.2023.01.027","volume":"309","author":"R Lin","year":"2023","unstructured":"Lin R, Wang J-Q, Liu Z, Xu J (2023) Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions. Eur J Oper Res 309(1):53\u201364","journal-title":"Eur J Oper Res"},{"key":"770_CR15","doi-asserted-by":"publisher","first-page":"102804","DOI":"10.1016\/j.omega.2022.102804","volume":"116","author":"R Lin","year":"2023","unstructured":"Lin R, Wang J-Q, Oulamara A (2023) Online scheduling on parallel-batch machines with periodic availability constraints and job delivery. Omega 116:102804","journal-title":"Omega"},{"issue":"2","key":"770_CR16","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.ejor.2020.01.065","volume":"285","author":"I Muter","year":"2020","unstructured":"Muter I (2020) Exact algorithms to minimize makespan on single and parallel batch processing machines. Eur J Oper Res 285(2):470\u2013483","journal-title":"Eur J Oper Res"},{"issue":"1","key":"770_CR17","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ejor.2012.03.001","volume":"221","author":"L Shen","year":"2012","unstructured":"Shen L, Buscher U (2012) Solving the serial batching problem in job shop manufacturing systems. Eur J Oper Res 221(1):14\u201326","journal-title":"Eur J Oper Res"},{"issue":"7","key":"770_CR18","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. Int J Prod Res 32(7):1615\u20131635","journal-title":"Int J Prod Res"},{"key":"770_CR19","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.ijpe.2014.06.019","volume":"156","author":"J-Q Wang","year":"2014","unstructured":"Wang J-Q, Leung JY-T (2014) Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan. Int J Prod Econ 156:325\u2013331","journal-title":"Int J Prod Econ"},{"issue":"4","key":"770_CR20","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10951-019-00623-9","volume":"23","author":"J-Q Wang","year":"2020","unstructured":"Wang J-Q, Fan G-Q, Liu Z (2020) Mixed batch scheduling on identical machines. J Sched 23(4):487\u2013496","journal-title":"J Sched"},{"key":"770_CR21","doi-asserted-by":"publisher","first-page":"102567","DOI":"10.1016\/j.omega.2021.102567","volume":"108","author":"J Xu","year":"2022","unstructured":"Xu J, Wang J-Q, Liu Z (2022) Parallel batch scheduling: impact of increasing machine capacity. Omega 108:102567","journal-title":"Omega"},{"issue":"3","key":"770_CR22","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 C-Y, Wong CK (2001) Minimizing makespan on a single batch processing machine with nonidentical job sizes. Naval Res Logist 48(3):226\u2013240","journal-title":"Naval Res Logist"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-024-00770-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-024-00770-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-024-00770-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T09:21:53Z","timestamp":1741771313000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-024-00770-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,8]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["770"],"URL":"https:\/\/doi.org\/10.1007\/s00291-024-00770-2","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,8]]},"assertion":[{"value":"31 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}