{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T19:51:21Z","timestamp":1780602681802,"version":"3.54.1"},"reference-count":84,"publisher":"Springer Science and Business Media LLC","issue":"22","license":[{"start":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T00:00:00Z","timestamp":1688515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T00:00:00Z","timestamp":1688515200000},"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":["Soft Comput"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s00500-023-08754-0","type":"journal-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T13:01:50Z","timestamp":1688562110000},"page":"17063-17091","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Unrelated parallel batch processing machine scheduling for production systems under carbon reduction policies: NSGA-II and MOGWO metaheuristics"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0731-3531","authenticated-orcid":false,"given":"Ali","family":"Fallahi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bahareh","family":"Shahidi-Zadeh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Seyed Taghi Akhavan","family":"Niaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,5]]},"reference":[{"issue":"6","key":"8754_CR1","doi-asserted-by":"crossref","first-page":"1680","DOI":"10.1080\/00207543.2014.952795","volume":"53","author":"M Abedi","year":"2015","unstructured":"Abedi M, Seidgar H, Fazlollahtabar H, Bijani R (2015) Bi-objective optimisation for scheduling the identical parallel batch-processing machines with arbitrary job sizes, unequal job release times and capacity limits. Int J Prod Res 53(6):1680\u20131711","journal-title":"Int J Prod Res"},{"key":"8754_CR2","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1016\/j.jclepro.2018.09.100","volume":"205","author":"M Akbar","year":"2018","unstructured":"Akbar M, Irohara T (2018) Scheduling for sustainable manufacturing: a review. J Clean Prod 205:866\u2013883","journal-title":"J Clean Prod"},{"key":"8754_CR3","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108808","volume":"174","author":"E Amani Bani","year":"2022","unstructured":"Amani Bani E, Fallahi A, Varmazyar M, Fathi M (2022) Designing a sustainable reverse supply chain network for COVID-19 vaccine waste under uncertainty. Comput Ind Eng 174:108808","journal-title":"Comput Ind Eng"},{"key":"8754_CR4","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.cie.2016.12.038","volume":"105","author":"JEC Arroyo","year":"2017","unstructured":"Arroyo JEC, Leung JY-T (2017a) An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times. Comput Ind Eng 105:84\u2013100","journal-title":"Comput Ind Eng"},{"key":"8754_CR5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.cor.2016.08.015","volume":"78","author":"JEC Arroyo","year":"2017","unstructured":"Arroyo JEC, Leung JY-T (2017b) Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times. Comput Oper Res 78:117\u2013128","journal-title":"Comput Oper Res"},{"key":"8754_CR6","doi-asserted-by":"crossref","DOI":"10.1016\/j.jclepro.2022.134098","volume":"376","author":"J Asadkhani","year":"2022","unstructured":"Asadkhani J, Fallahi A, Mokhtari H (2022) A sustainable supply chain under VMI-CS agreement with withdrawal policies for imperfect items. J Clean Prod 376:134098","journal-title":"J Clean Prod"},{"issue":"2","key":"8754_CR7","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/j.ejor.2020.11.016","volume":"292","author":"C Audet","year":"2021","unstructured":"Audet C, Bigeon J, Cartier D, Le Digabel S, Salomon L (2021) Performance indicators in multiobjective optimization. Eur J Oper Res 292(2):397\u2013422","journal-title":"Eur J Oper Res"},{"issue":"5","key":"8754_CR8","doi-asserted-by":"crossref","first-page":"1621","DOI":"10.1007\/s10845-010-0464-6","volume":"23","author":"A Bilyk","year":"2012","unstructured":"Bilyk A, M\u00f6nch L (2012) A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines. J Intell Manuf 23(5):1621\u20131635","journal-title":"J Intell Manuf"},{"issue":"19","key":"8754_CR9","doi-asserted-by":"crossref","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":"2","key":"8754_CR10","doi-asserted-by":"crossref","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"},{"issue":"4\u20135","key":"8754_CR11","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1051\/ro\/2015063","volume":"50","author":"J Cheng","year":"2016","unstructured":"Cheng J, Chu F, Chu C, Xia W (2016) Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices. RAIRO-Oper Res 50(4\u20135):715\u2013732","journal-title":"RAIRO-Oper Res"},{"issue":"16","key":"8754_CR12","doi-asserted-by":"crossref","first-page":"11377","DOI":"10.1007\/s00500-021-05943-7","volume":"25","author":"VK Chouhan","year":"2021","unstructured":"Chouhan VK, Khan SH, Hajiaghaei-Keshteli M (2021) Metaheuristic approaches to design and address multi-echelon sugarcane closed-loop supply chain network. Soft Comput 25(16):11377\u201311404","journal-title":"Soft Comput"},{"issue":"10","key":"8754_CR13","doi-asserted-by":"crossref","first-page":"2229","DOI":"10.1016\/j.compchemeng.2005.08.005","volume":"29","author":"CB Costa","year":"2005","unstructured":"Costa CB, Maciel MRW, Maciel Filho R (2005) Factorial design technique applied to genetic algorithm parameters in a batch cooling crystallization optimisation. Comput Chem Eng 29(10):2229\u20132241","journal-title":"Comput Chem Eng"},{"issue":"9","key":"8754_CR14","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1007\/s00170-011-3442-z","volume":"58","author":"P Damodaran","year":"2012","unstructured":"Damodaran P, Diyadawagamage DA, Ghrayeb O, V\u00e9lez-Gallego MC (2012) A particle swarm optimization algorithm for minimizing makespan of nonidentical parallel batch processing machines. Int J Adv Manuf Technol 58(9):1131\u20131140","journal-title":"Int J Adv Manuf Technol"},{"issue":"2","key":"8754_CR15","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1504\/EJIE.2009.023605","volume":"3","author":"P Damodaran","year":"2009","unstructured":"Damodaran P, Hirani NS, Velez-Gallego MC (2009) Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms. Eur J Ind Eng 3(2):187\u2013206","journal-title":"Eur J Ind Eng"},{"issue":"2","key":"8754_CR16","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"8754_CR17","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1016\/j.ejor.2015.05.019","volume":"248","author":"J-Y Ding","year":"2016","unstructured":"Ding J-Y, Song S, Wu C (2016) Carbon-efficient scheduling of flow shops by multi-objective optimization. Eur J Oper Res 248(3):758\u2013771","journal-title":"Eur J Oper Res"},{"key":"8754_CR18","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.118018","volume":"207","author":"A Fallahi","year":"2022","unstructured":"Fallahi A, Bani EA, Niaki STA (2022a) A constrained multi-item EOQ inventory model for reusable items: reinforcement learning-based differential evolution and particle swarm optimization. Expert Syst Appl 207:118018","journal-title":"Expert Syst Appl"},{"key":"8754_CR19","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.109798","volume":"131","author":"A Fallahi","year":"2022","unstructured":"Fallahi A, Mahnam M, Niaki STA (2022b) A discrete differential evolution with local search particle swarm optimization to direct angle and aperture optimization in IMRT treatment planning problem. Appl Soft Comput 131:109798","journal-title":"Appl Soft Comput"},{"key":"8754_CR20","doi-asserted-by":"publisher","unstructured":"Fallahi A, Mousavian Anaraki SA, Mokhtari H, Niaki STA (2022c) Blood plasma supply chain planning to respond COVID-19 pandemic: a case study. Environ Dev Sustain. https:\/\/doi.org\/10.1007\/s10668-022-02793-7","DOI":"10.1007\/s10668-022-02793-7"},{"issue":"4","key":"8754_CR21","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.jmsy.2011.08.004","volume":"30","author":"K Fang","year":"2011","unstructured":"Fang K, Uhan N, Zhao F, Sutherland JW (2011) A new approach to scheduling in manufacturing for power consumption and carbon footprint reduction. J Manuf Syst 30(4):234\u2013240","journal-title":"J Manuf Syst"},{"key":"8754_CR22","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.apenergy.2019.04.155","volume":"249","author":"M Foumani","year":"2019","unstructured":"Foumani M, Smith-Miles K (2019) The impact of various carbon reduction policies on green flowshop scheduling. Appl Energy 249:300\u2013315","journal-title":"Appl Energy"},{"issue":"1","key":"8754_CR23","doi-asserted-by":"crossref","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"},{"issue":"3","key":"8754_CR24","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1016\/j.ejor.2015.07.017","volume":"248","author":"C Gahm","year":"2016","unstructured":"Gahm C, Denz F, Dirr M, Tuma A (2016) Energy-efficient scheduling in manufacturing companies: a review and research framework. Eur J Oper Res 248(3):744\u2013757","journal-title":"Eur J Oper Res"},{"key":"8754_CR25","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.jmsy.2015.08.002","volume":"37","author":"A Giret","year":"2015","unstructured":"Giret A, Trentesaux D, Prabhu V (2015) Sustainability in manufacturing operations scheduling: a state of the art review. J Manuf Syst 37:126\u2013140","journal-title":"J Manuf Syst"},{"key":"8754_CR26","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119077","volume":"213","author":"A Goli","year":"2023","unstructured":"Goli A, Ala A, Hajiaghaei-Keshteli M (2023) Efficient multi-objective meta-heuristic algorithms for energy-aware non-permutation flow-shop scheduling problem. Expert Syst Appl 213:119077","journal-title":"Expert Syst Appl"},{"issue":"1","key":"8754_CR27","first-page":"532","volume":"28","author":"A Golshahi-Roudbaneh","year":"2021","unstructured":"Golshahi-Roudbaneh A, Hajiaghaei-Keshteli M, Paydar M (2021) Cross-dock scheduling considering time windows and deadline for truck departures. Sci Iran 28(1):532\u2013546","journal-title":"Sci Iran"},{"issue":"1","key":"8754_CR28","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s10479-021-04066-4","volume":"319","author":"A Haeri","year":"2022","unstructured":"Haeri A, Hosseini-Motlagh S-M, Samani MRG, Rezaei M (2022) An integrated socially responsible-efficient approach toward health service network design. Ann Oper Res 319(1):463\u2013516","journal-title":"Ann Oper Res"},{"issue":"12","key":"8754_CR29","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1177\/0037549718811591","volume":"95","author":"M Hamid","year":"2019","unstructured":"Hamid M, Hamid M, Musavi M, Azadeh A (2019) Scheduling elective patients based on sequence-dependent setup times in an open-heart surgical department using an optimization and simulation approach. SIMULATION 95(12):1141\u20131164","journal-title":"SIMULATION"},{"issue":"2","key":"8754_CR30","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","volume":"5","author":"Y Ikura","year":"1986","unstructured":"Ikura Y, Gimple M (1986) Efficient scheduling algorithms for a single batch processing machine. Oper Res Lett 5(2):61\u201365","journal-title":"Oper Res Lett"},{"issue":"5","key":"8754_CR31","doi-asserted-by":"crossref","first-page":"3934","DOI":"10.3390\/su15053934","volume":"15","author":"B Ji","year":"2023","unstructured":"Ji B, Xiao X, Yu SS, Wu G (2023) A hybrid large neighborhood search method for minimizing makespan on unrelated parallel batch processing machines with incompatible job families. Sustainability 15(5):3934","journal-title":"Sustainability"},{"key":"8754_CR32","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.cie.2019.03.033","volume":"131","author":"Z-H Jia","year":"2019","unstructured":"Jia Z-H, Wang Y, Wu C, Yang Y, Zhang X-Y, Chen H-P (2019) Multi-objective energy-aware batch scheduling using ant colony optimization algorithm. Comput Ind Eng 131:41\u201356","journal-title":"Comput Ind Eng"},{"issue":"4-part-1","key":"8754_CR33","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1287\/opre.1090.0788","volume":"58","author":"P Jula","year":"2010","unstructured":"Jula P, Leachman RC (2010) Coordinated multistage scheduling of parallel batch-processing machines under multiresource constraints. Oper Res 58(4-part-1):933\u2013947","journal-title":"Oper Res"},{"issue":"6","key":"8754_CR34","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1016\/j.engappai.2010.01.031","volume":"23","author":"AH Kashan","year":"2010","unstructured":"Kashan AH, Karimi B, Jolai F (2010) An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes. Eng Appl Artif Intell 23(6):911\u2013922","journal-title":"Eng Appl Artif Intell"},{"key":"8754_CR35","volume":"112","author":"AH Kashan","year":"2022","unstructured":"Kashan AH, Ozturk O (2022) Improved MILP formulation equipped with valid inequalities for scheduling a batch processing machine with non-identical job sizes. Omega 112:102673","journal-title":"Omega"},{"issue":"1","key":"8754_CR36","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1504\/EJIE.2019.097920","volume":"13","author":"T Keshavarz","year":"2019","unstructured":"Keshavarz T, Salmasi N, Varmazyar M (2019) Flowshop sequence-dependent group scheduling with minimisation of weighted earliness and tardiness. Eur J Ind Eng 13(1):54\u201380","journal-title":"Eur J Ind Eng"},{"issue":"1","key":"8754_CR37","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/002075499192020","volume":"37","author":"C-Y Lee","year":"1999","unstructured":"Lee C-Y (1999) Minimizing makespan on a single batch processing machine with dynamic job arrivals. Int J Prod Res 37(1):219\u2013236","journal-title":"Int J Prod Res"},{"issue":"12","key":"8754_CR38","doi-asserted-by":"crossref","first-page":"2983","DOI":"10.1016\/j.cor.2013.06.016","volume":"40","author":"X Li","year":"2013","unstructured":"Li X, Huang Y, Tan Q, Chen H (2013) Scheduling unrelated parallel batch processing machines with non-identical job sizes. Comput Oper Res 40(12):2983\u20132990","journal-title":"Comput Oper Res"},{"key":"8754_CR39","volume":"95","author":"Y Li","year":"2020","unstructured":"Li Y, Huang W, Wu R, Guo K (2020) An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem. Appl Soft Comput 95:106544","journal-title":"Appl Soft Comput"},{"issue":"2","key":"8754_CR40","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1080\/00207543.2013.825740","volume":"52","author":"C-H Liu","year":"2014","unstructured":"Liu C-H, Huang D-H (2014) Reduction of power consumption and carbon footprints by applying multi-objective optimisation via genetic algorithms. Int J Prod Res 52(2):337\u2013352","journal-title":"Int J Prod Res"},{"issue":"22","key":"8754_CR41","doi-asserted-by":"crossref","first-page":"19723","DOI":"10.1007\/s00521-022-07704-5","volume":"34","author":"SN Makhadmeh","year":"2022","unstructured":"Makhadmeh SN, Alomari OA, Mirjalili S, Al-Betar MA, Elnagar A (2022) Recent advances in multi-objective grey wolf optimizer, its versions and applications. Neural Comput Appl 34(22):19723\u201319749","journal-title":"Neural Comput Appl"},{"issue":"9\u201310","key":"8754_CR42","doi-asserted-by":"crossref","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\u201310):990\u20131001","journal-title":"Int J Adv Manuf Technol"},{"key":"8754_CR43","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"key":"8754_CR44","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.eswa.2015.10.039","volume":"47","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Saremi S, Mirjalili SM, Coelho L, d. S. (2016) Multi-objective grey wolf optimizer: a novel algorithm for multi-criterion optimization. Expert Syst Appl 47:106\u2013119","journal-title":"Expert Syst Appl"},{"key":"8754_CR45","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.compchemeng.2017.05.004","volume":"104","author":"H Mokhtari","year":"2017","unstructured":"Mokhtari H, Hasani A (2017) An energy-efficient multi-objective optimization for flexible job-shop scheduling problem. Comput Chem Eng 104:339\u2013352","journal-title":"Comput Chem Eng"},{"issue":"21","key":"8754_CR46","doi-asserted-by":"crossref","first-page":"16383","DOI":"10.1007\/s00500-020-04948-y","volume":"24","author":"M Mousavi","year":"2020","unstructured":"Mousavi M, Hajiaghaei-Keshteli M, Tavakkoli-Moghaddam R (2020) Two calibrated meta-heuristics to solve an integrated scheduling problem of production and air transportation with the interval due date. Soft Comput 24(21):16383\u201316411","journal-title":"Soft Comput"},{"issue":"11","key":"8754_CR47","doi-asserted-by":"crossref","first-page":"2994","DOI":"10.1016\/j.cor.2009.01.016","volume":"36","author":"AA Najafi","year":"2009","unstructured":"Najafi AA, Niaki STA, Shahsavar M (2009) A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations. Comput Oper Res 36(11):2994\u20133001","journal-title":"Comput Oper Res"},{"key":"8754_CR48","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.109862","volume":"132","author":"A Nikoubin","year":"2023","unstructured":"Nikoubin A, Mahnam M, Moslehi G (2023) A relax-and-fix Pareto-based algorithm for a bi-objective vaccine distribution network considering a mix-and-match strategy in pandemics. Appl Soft Comput 132:109862","journal-title":"Appl Soft Comput"},{"key":"8754_CR49","doi-asserted-by":"crossref","unstructured":"Ning T, Huang Y (2023) Low carbon emission management for flexible job shop scheduling: a study case in China. J Ambient Intell Humaniz Comput 14(2):789\u2013805","DOI":"10.1007\/s12652-021-03330-6"},{"key":"8754_CR50","doi-asserted-by":"crossref","DOI":"10.1016\/j.jclepro.2020.121449","volume":"263","author":"T Ning","year":"2020","unstructured":"Ning T, Wang Z, Zhang P, Gou T (2020) Integrated optimization of disruption management and scheduling for reducing carbon emission in manufacturing. J Clean Prod 263:121449","journal-title":"J Clean Prod"},{"issue":"4","key":"8754_CR51","doi-asserted-by":"crossref","first-page":"1399","DOI":"10.1016\/j.asoc.2011.11.019","volume":"12","author":"S Noori-Darvish","year":"2012","unstructured":"Noori-Darvish S, Mahdavi I, Mahdavi-Amiri N (2012) A bi-objective possibilistic programming model for open shop scheduling problems with sequence-dependent setup times, fuzzy processing times, and fuzzy due dates. Appl Soft Comput 12(4):1399\u20131416","journal-title":"Appl Soft Comput"},{"key":"8754_CR52","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.cie.2015.10.019","volume":"91","author":"S Pakzad-Moghaddam","year":"2016","unstructured":"Pakzad-Moghaddam S (2016) A L\u00e9vy flight embedded particle swarm optimization for multi-objective parallel-machine scheduling with learning and adapting considerations. Comput Ind Eng 91:109\u2013128","journal-title":"Comput Ind Eng"},{"issue":"10","key":"8754_CR53","doi-asserted-by":"crossref","first-page":"1720","DOI":"10.1016\/j.cor.2009.12.007","volume":"37","author":"NR Parsa","year":"2010","unstructured":"Parsa NR, Karimi B, Kashan AH (2010) A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes. Comput Oper Res 37(10):1720\u20131730","journal-title":"Comput Oper Res"},{"issue":"2","key":"8754_CR54","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/j.advengsoft.2009.07.001","volume":"41","author":"SHR Pasandideh","year":"2010","unstructured":"Pasandideh SHR, Niaki STA, Yeganeh JA (2010) A parameter-tuned genetic algorithm for multi-product economic production quantity model with space constraint, discrete delivery orders and shortages. Adv Eng Softw 41(2):306\u2013314","journal-title":"Adv Eng Softw"},{"key":"8754_CR55","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling","author":"ML Pinedo","year":"2012","unstructured":"Pinedo ML (2012) Scheduling, vol 29. Springer, Berlin"},{"issue":"2","key":"8754_CR56","doi-asserted-by":"crossref","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":"3","key":"8754_CR57","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10732-020-09461-x","volume":"27","author":"E Queiroga","year":"2021","unstructured":"Queiroga E, Pinheiro RG, Christ Q, Subramanian A, Pessoa AA (2021) Iterated local search for single machine total weighted tardiness batch scheduling. J Heuristics 27(3):353\u2013438","journal-title":"J Heuristics"},{"issue":"1","key":"8754_CR58","doi-asserted-by":"crossref","first-page":"98","DOI":"10.3390\/pr10010098","volume":"10","author":"I Rahimi","year":"2022","unstructured":"Rahimi I, Gandomi AH, Deb K, Chen F, Nikoo MR (2022) Scheduling by NSGA-II: review and bibliometric analysis. Processes 10(1):98","journal-title":"Processes"},{"issue":"4","key":"8754_CR59","first-page":"21","volume":"16","author":"A Sadati","year":"2019","unstructured":"Sadati A, Tavakkoli-Moghaddam R, Naderi B, Mohammadi M (2019) A bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics. Iran J Fuzzy Syst 16(4):21\u201340","journal-title":"Iran J Fuzzy Syst"},{"key":"8754_CR60","doi-asserted-by":"crossref","unstructured":"Sadeghi AH, Amani Bani E, Fallahi A, Handfield R (2023) Grey wolf optimizer and whale optimization algorithm for stochastic inventory management of reusable products in a two-level supply chain. IEEE Access","DOI":"10.1109\/ACCESS.2023.3269292"},{"key":"8754_CR61","unstructured":"Schott JR (1995) Fault tolerant design using single and multicriteria genetic algorithm optimization. Massachusetts Institute of Technology"},{"issue":"1","key":"8754_CR62","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ejor.2006.03.056","volume":"181","author":"S Shadrokh","year":"2007","unstructured":"Shadrokh S, Kianfar F (2007) A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty. Eur J Oper Res 181(1):86\u2013101","journal-title":"Eur J Oper Res"},{"key":"8754_CR63","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.cor.2017.06.019","volume":"88","author":"B Shahidi-Zadeh","year":"2017","unstructured":"Shahidi-Zadeh B, Tavakkoli-Moghaddam R, Taheri-Moghadam A, Rastgar I (2017) Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study. Comput Oper Res 88:71\u201390","journal-title":"Comput Oper Res"},{"key":"8754_CR64","doi-asserted-by":"crossref","DOI":"10.1016\/j.compchemeng.2021.107501","volume":"155","author":"H Shahmoradi-Moghadam","year":"2021","unstructured":"Shahmoradi-Moghadam H, Sch\u00f6nberger J (2021) Coordinated allocation production routing problem for mobile supply chains with shared factories. Comput Chem Eng 155:107501","journal-title":"Comput Chem Eng"},{"issue":"1","key":"8754_CR65","first-page":"92","volume":"29","author":"K Shahnaghi","year":"2016","unstructured":"Shahnaghi K, Shahmoradi-Moghadam H, Noroozi A, Mokhtari H (2016) A robust modelling and optimisation framework for a batch processing flow shop production system in the presence of uncertainties. Int J Comput Integr Manuf 29(1):92\u2013106","journal-title":"Int J Comput Integr Manuf"},{"issue":"3","key":"8754_CR66","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221\u2013248","journal-title":"Evol Comput"},{"key":"8754_CR67","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.cie.2016.09.018","volume":"101","author":"N Suhaimi","year":"2016","unstructured":"Suhaimi N, Nguyen C, Damodaran P (2016) Lagrangian approach to minimize makespan of non-identical parallel batch processing machines. Comput Ind Eng 101:295\u2013302","journal-title":"Comput Ind Eng"},{"issue":"22","key":"8754_CR68","doi-asserted-by":"crossref","first-page":"5072","DOI":"10.1016\/j.ins.2007.06.001","volume":"177","author":"R Tavakkoli-Moghaddam","year":"2007","unstructured":"Tavakkoli-Moghaddam R, Rahimi-Vahed A, Mirzaei AH (2007) A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Inf Sci 177(22):5072\u20135090","journal-title":"Inf Sci"},{"key":"8754_CR69","doi-asserted-by":"crossref","DOI":"10.1016\/j.jclepro.2021.130056","volume":"333","author":"EB Tirkolaee","year":"2022","unstructured":"Tirkolaee EB, Goli A, Ghasemi P, Goodarzian F (2022) Designing a sustainable closed-loop supply chain network of face masks during the COVID-19 pandemic: Pareto-based algorithms. J Clean Prod 333:130056","journal-title":"J Clean Prod"},{"issue":"2","key":"8754_CR70","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/j.fss.2007.08.010","volume":"159","author":"SA Torabi","year":"2008","unstructured":"Torabi SA, Hassini E (2008) An interactive possibilistic programming approach for multiple objective supply chain master planning. Fuzzy Sets Syst 159(2):193\u2013214","journal-title":"Fuzzy Sets Syst"},{"key":"8754_CR71","doi-asserted-by":"crossref","unstructured":"Van Veldhuizen DA (1999) Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. Air Force Institute of Technology","DOI":"10.1145\/298151.298382"},{"issue":"2","key":"8754_CR72","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1080\/24725854.2019.1628372","volume":"52","author":"M Varmazyar","year":"2020","unstructured":"Varmazyar M, Akhavan-Tabatabaei R, Salmasi N, Modarres M (2020) Operating room scheduling problem under uncertainty: Application of continuous phase-type distributions. IISE Transactions 52(2):216\u2013235","journal-title":"IISE Transactions"},{"issue":"20","key":"8754_CR73","doi-asserted-by":"crossref","first-page":"5843","DOI":"10.1080\/00207543.2011.632385","volume":"50","author":"M Varmazyar","year":"2012","unstructured":"Varmazyar M, Salmasi N (2012) Sequence-dependent flow shop scheduling problem minimising the number of tardy jobs. Int J Prod Res 50(20):5843\u20135858","journal-title":"Int J Prod Res"},{"key":"8754_CR74","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-85729-652-8","volume-title":"Multi-objective evolutionary optimisation for product design and manufacturing","author":"L Wang","year":"2011","unstructured":"Wang L, Ng AH, Deb K (2011) Multi-objective evolutionary optimisation for product design and manufacturing. Springer, Berlin"},{"key":"8754_CR75","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1016\/j.jclepro.2016.07.206","volume":"137","author":"S Wang","year":"2016","unstructured":"Wang S, Liu M, Chu F, Chu C (2016) Bi-objective optimization of a single machine batch scheduling problem with energy cost consideration. J Clean Prod 137:1205\u20131215","journal-title":"J Clean Prod"},{"key":"8754_CR76","volume":"167","author":"Y Wang","year":"2021","unstructured":"Wang Y, Jia Z-H, Li K (2021) A multi-objective co-evolutionary algorithm of scheduling on parallel non-identical batch machines. Expert Syst Appl 167:114145","journal-title":"Expert Syst Appl"},{"key":"8754_CR77","doi-asserted-by":"crossref","unstructured":"Wu X, Cao Z (2022) An improved multi-objective evolutionary algorithm based on decomposition for solving re-entrant hybrid flow shop scheduling problem with batch processing machines. Comput Ind Eng 169:108236","DOI":"10.1016\/j.cie.2022.108236"},{"key":"8754_CR78","doi-asserted-by":"publisher","unstructured":"Xiao X, Ji B, Yu SS, Wu G (2023) A tabu-based adaptive large neighborhood search for scheduling unrelated parallel batch processing machines with non-identical job sizes and dynamic job arrivals. Flex Serv Manuf J. https:\/\/doi.org\/10.1007\/s10696-023-09488-9","DOI":"10.1007\/s10696-023-09488-9"},{"issue":"1","key":"8754_CR79","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.ijpe.2013.04.053","volume":"145","author":"R Xu","year":"2013","unstructured":"Xu R, Chen H, Li X (2013) A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system. Int J Prod Econ 145(1):371\u2013386","journal-title":"Int J Prod Econ"},{"key":"8754_CR80","doi-asserted-by":"crossref","unstructured":"Yi Q, Li C, Tang Y, Wang Q (2012) A new operational framework to job shop scheduling for reducing carbon emissions. In: 2012 IEEE international conference on automation science and engineering (CASE), pp 58\u201363","DOI":"10.1109\/CoASE.2012.6386372"},{"issue":"2","key":"8754_CR81","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1177\/0954405414527959","volume":"229","author":"C Zhang","year":"2015","unstructured":"Zhang C, Gu P, Jiang P (2015) Low-carbon scheduling and estimating for a flexible job shop based on carbon footprint and carbon efficiency of multi-job processing. Proc Inst Mech Eng Part B J Eng Manuf 229(2):328\u2013342","journal-title":"Proc Inst Mech Eng Part B J Eng Manuf"},{"key":"8754_CR82","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.cor.2018.04.009","volume":"96","author":"S Zhou","year":"2018","unstructured":"Zhou S, Li X, Du N, Pang Y, Chen H (2018a) A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost. Comput Oper Res 96:55\u201368","journal-title":"Comput Oper Res"},{"key":"8754_CR83","first-page":"254","volume":"334","author":"S Zhou","year":"2018","unstructured":"Zhou S, Xie J, Du N, Pang Y (2018b) 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"},{"issue":"3","key":"8754_CR84","doi-asserted-by":"crossref","first-page":"1430","DOI":"10.1109\/TCYB.2019.2939219","volume":"51","author":"S Zhou","year":"2019","unstructured":"Zhou S, Xing L, Zheng X, Du N, Wang L, Zhang Q (2019) A self-adaptive differential evolution algorithm for scheduling a single batch-processing machine with arbitrary job sizes and release times. IEEE Trans Cybern 51(3):1430\u20131442","journal-title":"IEEE Trans Cybern"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08754-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-08754-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08754-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,26]],"date-time":"2023-09-26T13:05:05Z","timestamp":1695733505000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-08754-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,5]]},"references-count":84,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["8754"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-08754-0","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,5]]},"assertion":[{"value":"5 June 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2023","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":"Conflict of interest"}},{"value":"This study has not been duplicated publication or submitted elsewhere. The Local Ethics Committee approval was obtained.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to publish"}}]}}