{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T05:32:16Z","timestamp":1769837536147,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T00:00:00Z","timestamp":1622160000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T00:00:00Z","timestamp":1622160000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71971002"],"award-info":[{"award-number":["71971002"]}],"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":["71871076"],"award-info":[{"award-number":["71871076"]}],"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":["61872002"],"award-info":[{"award-number":["61872002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Humanity and Social Science Youth Foundation of Ministry of Education of China","award":["15YJC630041"],"award-info":[{"award-number":["15YJC630041"]}]},{"name":"Natural Science Foundation of Anhui Provincial Department of Education","award":["KJ2015A062"],"award-info":[{"award-number":["KJ2015A062"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10489-021-02336-z","type":"journal-article","created":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T03:51:26Z","timestamp":1622173886000},"page":"1752-1769","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An ant colony-based algorithm for integrated scheduling on batch machines with non-identical capacities"],"prefix":"10.1007","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6607-7025","authenticated-orcid":false,"given":"Zhao-hong","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-fei","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,28]]},"reference":[{"issue":"7","key":"2336_CR1","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"},{"issue":"9-10","key":"2336_CR2","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1007\/s00170-005-2585-1","volume":"29","author":"M Mathirajan","year":"2006","unstructured":"Mathirajan M, Sivakumar AI (2006) A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Int J Adv Manuf Technol 29(9-10):990\u20131001","journal-title":"Int J Adv Manuf Technol"},{"issue":"4","key":"2336_CR3","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1016\/j.cie.2004.12.004","volume":"48","author":"JM Garc\u00eda","year":"2005","unstructured":"Garc\u00eda JM, Lozano S (2005) Production and delivery scheduling problem with time windows. Comput Ind Eng 48(4):733\u2013742","journal-title":"Comput Ind Eng"},{"key":"2336_CR4","unstructured":"Devapriya P, Ferrell W, Geismar N (2006) Optimal fleet size of an integrated production and distribution scheduling problem for a perishable product. In: 2006 IIE annual conference. Institute of Industrial and Systems Engineers"},{"issue":"2","key":"2336_CR5","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":"3","key":"2336_CR6","first-page":"331","volume":"9","author":"P Beldar","year":"2018","unstructured":"Beldar P, Costa A (2018) Single machine batch processing problem with release dates to minimize total completion time. Int J Ind Eng Comput 9(3):331\u2013348","journal-title":"Int J Ind Eng Comput"},{"issue":"2","key":"2336_CR7","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.asoc.2012.10.021","volume":"13","author":"B Cheng","year":"2013","unstructured":"Cheng B, Wang Q, Yang S, Hu X (2013) An improved ant colony optimization for scheduling identical parallel batching machines with arbitrary job sizes. Appl Soft Comput 13(2):765\u2013772","journal-title":"Appl Soft Comput"},{"key":"2336_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.asoc.2015.01.013","volume":"29","author":"M Al-Salamah","year":"2015","unstructured":"Al-Salamah M (2015) Constrained binary artificial bee colony to minimize the makespan for single machine batch processing with non-identical job sizes. Appl Soft Comput 29:379\u2013385","journal-title":"Appl Soft Comput"},{"issue":"1","key":"2336_CR9","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1080\/00207543.2016.1200762","volume":"55","author":"X Li","year":"2017","unstructured":"Li X, Li Y, Wang Y (2017) Minimising makespan on a batch processing machine using heuristics improved by an enumeration scheme. Int J Prod Res 55(1):176\u2013186","journal-title":"Int J Prod Res"},{"key":"2336_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ijpe.2015.07.021","volume":"169","author":"ZH Jia","year":"2015","unstructured":"Jia ZH, Li K, Leung JYT (2015) Effective heuristic for makespan minimization in parallel batch machines with non-identical capacities. Int J Prod Econ 169:1\u201310","journal-title":"Int J Prod Econ"},{"issue":"6","key":"2336_CR11","doi-asserted-by":"publisher","first-page":"1815","DOI":"10.1080\/00207543.2016.1253889","volume":"55","author":"O Ozturk","year":"2017","unstructured":"Ozturk O, Begen MA, Zaric GS (2017) A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan. Int J Prod Res 55(6):1815\u20131831","journal-title":"Int J Prod Res"},{"key":"2336_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.future.2016.07.017","volume":"67","author":"Z Jia","year":"2017","unstructured":"Jia Z, Li X, Leung JYT (2017) Minimizing makespan for arbitrary size jobs with release times on p-batch machines with arbitrary capacities. Futur Gener Comput Syst 67:22\u201334","journal-title":"Futur Gener Comput Syst"},{"key":"2336_CR13","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1016\/j.endm.2010.05.164","volume":"36","author":"A Bellanger","year":"2010","unstructured":"Bellanger A, Oulamara A, Kovalyov MY (2010) Minimizing total completion time on a batching machine with job processing time compatibilities. Electron Notes Discrete Math 36:1295\u20131302","journal-title":"Electron Notes Discrete Math"},{"issue":"5","key":"2336_CR14","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1016\/j.cor.2011.06.003","volume":"39","author":"S Yao","year":"2012","unstructured":"Yao S, Jiang Z, Li N (2012) A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals. Comput Oper Res 39(5):939\u2013951","journal-title":"Comput Oper Res"},{"issue":"12","key":"2336_CR15","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1016\/j.ipl.2014.06.009","volume":"114","author":"SS Li","year":"2014","unstructured":"Li SS, Zhang YZ (2014) Serial batch scheduling on uniform parallel machines to minimize total completion time. Inf Process Lett 114(12):692\u2013695","journal-title":"Inf Process Lett"},{"issue":"6","key":"2336_CR16","first-page":"1255","volume":"16","author":"R Xu","year":"2010","unstructured":"Xu R, Chen HP, Shao H, Wang SS (2010) Two kinds of ant colony algorithms to minimize the total completion time for batch scheduling problem. Comput Integr Manuf Syst 16(6):1255\u20131264","journal-title":"Comput Integr Manuf Syst"},{"key":"2336_CR17","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.cie.2018.08.009","volume":"125","author":"ZH Jia","year":"2018","unstructured":"Jia ZH, Zhang H, Long WT, Leung JYT, Li K, Li W (2018) A meta-heuristic for minimizing total weighted flow time on parallel batch machines. Comput Ind Eng 125:298\u2013308","journal-title":"Comput Ind Eng"},{"key":"2336_CR18","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1016\/j.cie.2015.06.008","volume":"87","author":"Z Li","year":"2015","unstructured":"Li Z, Chen H, Xu R, Li X (2015) Earliness\u2013tardiness minimization on scheduling a batch processing machine with non-identical job sizes. Comput Ind Eng 87:590\u2013599","journal-title":"Comput Ind Eng"},{"issue":"11","key":"2336_CR19","doi-asserted-by":"publisher","first-page":"3266","DOI":"10.1080\/00207543.2017.1304661","volume":"55","author":"JM Yu","year":"2017","unstructured":"Yu JM, Huang R, Lee DH (2017) Iterative algorithms for batching and scheduling to minimise the total job tardiness in two-stage hybrid flow shops. Int J Prod Res 55(11):3266\u20133282","journal-title":"Int J Prod Res"},{"issue":"9-12","key":"2336_CR20","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1007\/s00170-013-5324-z","volume":"7","author":"R Gokhale","year":"2014","unstructured":"Gokhale R, Mathirajan M (2014) Minimizing total weighted tardiness on heterogeneous batch processors with incompatible job families. Int J Adv Manuf Technol 7(9-12):1563\u20131578","journal-title":"Int J Adv Manuf Technol"},{"issue":"5","key":"2336_CR21","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1504\/EJIE.2013.057380","volume":"7","author":"FD Chou","year":"2013","unstructured":"Chou FD (2013) Minimising the total weighted tardiness for non-identical parallel batch processing machines with job release times and non-identical job sizes. Eur J Ind Eng 7(5):529\u2013557","journal-title":"Eur J Ind Eng"},{"key":"2336_CR22","doi-asserted-by":"crossref","unstructured":"Anoki\u0107 A, Stanimirovi\u0107 Z, Staki\u0107 D, Davidovi\u0107 T (2019) Metaheuristic approaches to a vehicle scheduling problem in sugar beet transportation. Oper Res :1\u201333","DOI":"10.1007\/s12351-019-00495-z"},{"key":"2336_CR23","doi-asserted-by":"crossref","unstructured":"Chavhan S, Gupta D, Chandana B, Chidambaram RK, Khanna A, Rodrigues JJ (2020) A novel emergent intelligence technique for public transport vehicle allocation problem in a dynamic transportation system. IEEE Trans Intell Transp Syst","DOI":"10.1109\/TITS.2020.3011198"},{"key":"2336_CR24","doi-asserted-by":"crossref","unstructured":"Islam MR, Mahmud MR, Pritom RM (2019) Transportation scheduling optimization by a collaborative strategy in supply chain management with tpl using chemical reaction optimization. Neural Comput Applic :1\u201326","DOI":"10.1007\/s00521-019-04218-5"},{"key":"2336_CR25","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1051\/ijmqe\/2019013","volume":"10","author":"J Peng","year":"2019","unstructured":"Peng J (2019) Optimizing the transportation route of fresh food in cold chain logistics by improved genetic algorithms. Int J Metrol Qual Eng 10:14","journal-title":"Int J Metrol Qual Eng"},{"key":"2336_CR26","doi-asserted-by":"crossref","unstructured":"Pitakaso R, Sethanan K, Jamrus T (2020) Hybrid pso and alns algorithm for a software and mobile application for transportation in the ice manufacturing industry. Comput Ind Eng :106461","DOI":"10.1016\/j.cie.2020.106461"},{"issue":"2","key":"2336_CR27","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.ejor.2014.12.002","volume":"243","author":"A Mensendiek","year":"2015","unstructured":"Mensendiek A, Gupta JN, Herrmann J (2015) Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness. Eur J Oper Res 243(2):514\u2013522","journal-title":"Eur J Oper Res"},{"key":"2336_CR28","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.cor.2018.07.026","volume":"102","author":"ZH Jia","year":"2019","unstructured":"Jia ZH, Zhuo XX, Leung JYT, Li K (2019) Integrated production and transportation on parallel batch machines to minimize total weighted delivery time. Comput Oper Res 102:39\u201351","journal-title":"Comput Oper Res"},{"issue":"2","key":"2336_CR29","doi-asserted-by":"publisher","first-page":"146","DOI":"10.3390\/math8020146","volume":"8","author":"L Liu","year":"2020","unstructured":"Liu L, Liu S (2020) Integrated production and distribution problem of perishable products with a minimum total order weighted delivery time. Mathematics 8(2):146","journal-title":"Mathematics"},{"key":"2336_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ijpe.2016.03.006","volume":"176","author":"P Liu","year":"2016","unstructured":"Liu P, Lu X (2016) Integrated production and job delivery scheduling with an availability constraint. Int J Prod Econ 176:1\u20136","journal-title":"Int J Prod Econ"},{"key":"2336_CR31","doi-asserted-by":"crossref","unstructured":"Jia ZH, Huo SY, Li K, Chen HP (2019) Integrated scheduling on parallel batch processing machines with non-identical capacities. Eng Optim 1\u201316","DOI":"10.1080\/0305215X.2019.1613388"},{"issue":"2","key":"2336_CR32","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1287\/ijoc.2016.0726","volume":"29","author":"F Li","year":"2017","unstructured":"Li F, Chen ZL, Tang L (2017) Integrated production, inventory and delivery problems: Complexity and algorithms. INFORMS J Comput 29(2):232\u2013250","journal-title":"INFORMS J Comput"},{"issue":"1","key":"2336_CR33","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/opre.1080.0688","volume":"58","author":"ZL Chen","year":"2010","unstructured":"Chen ZL (2010) Integrated production and outbound distribution scheduling: review and extensions. Oper Res 58(1):130\u2013148","journal-title":"Oper Res"},{"issue":"1","key":"2336_CR34","first-page":"94","volume":"19","author":"DY Wang","year":"2015","unstructured":"Wang DY, Grunder O, Moudni AE (2015) Integrated scheduling of production and distribution operations: a review. Int J Ind Syst Eng 19(1):94\u2013122","journal-title":"Int J Ind Syst Eng"},{"key":"2336_CR35","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.cie.2017.09.037","volume":"113","author":"M Hulett","year":"2017","unstructured":"Hulett M, Damodaran P, Amouie M (2017) Scheduling non-identical parallel batch processing machines to minimize total weighted tardiness using particle swarm optimization. Comput Ind Eng 113:425\u2013436","journal-title":"Comput Ind Eng"},{"key":"2336_CR36","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/j.amc.2018.04.024","volume":"334","author":"S Zhou","year":"2018","unstructured":"Zhou S, Xie J, Du N, Pang Y (2018) A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes. Appl Math Comput 334:254\u2013268","journal-title":"Appl Math Comput"},{"key":"2336_CR37","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.eswa.2019.01.002","volume":"123","author":"K Li","year":"2019","unstructured":"Li K, Xiao W, Yang S (2019) Minimizing total tardiness on two uniform parallel machines considering a cost constraint. Expert Systems With Applications 123:143\u2013153","journal-title":"Expert Systems With Applications"},{"key":"2336_CR38","doi-asserted-by":"publisher","first-page":"112920","DOI":"10.1016\/j.eswa.2019.112920","volume":"141","author":"ZH Jia","year":"2020","unstructured":"Jia ZH, Gao LY, Zhang XY (2020) A new history-guided multi-objective evolutionary algorithm based on decomposition for batching scheduling. Expert Syst Appl 141:112920","journal-title":"Expert Syst Appl"},{"key":"2336_CR39","doi-asserted-by":"publisher","first-page":"105914","DOI":"10.1016\/j.asoc.2019.105914","volume":"86","author":"ZH Jia","year":"2020","unstructured":"Jia ZH, Li YJ, Li K, Chen HP (2020) Weak-restriction bi-objective optimization algorithm for scheduling with rejection on non-identical batch processing machines. Appl Soft Comput 86:105914","journal-title":"Appl Soft Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02336-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02336-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02336-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T07:20:49Z","timestamp":1699082449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02336-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,28]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["2336"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02336-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,28]]},"assertion":[{"value":"6 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2021","order":2,"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 they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}