{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T21:57:00Z","timestamp":1781647020601,"version":"3.54.5"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T00:00:00Z","timestamp":1708041600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T00:00:00Z","timestamp":1708041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Ministry of Education of Humanities and Social Science","award":["22YJC630050"],"award-info":[{"award-number":["22YJC630050"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2022M710996"],"award-info":[{"award-number":["2022M710996"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010814","name":"Anhui Provincial Department of Education","doi-asserted-by":"publisher","award":["KJ2020A0069"],"award-info":[{"award-number":["KJ2020A0069"]}],"id":[{"id":"10.13039\/501100010814","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003995","name":"Natural Science Foundation of Anhui Province","doi-asserted-by":"publisher","award":["2108085QG291 and 2108085QG287"],"award-info":[{"award-number":["2108085QG291 and 2108085QG287"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Anhui Province University Collaborative Innovation Project","award":["GXXT-2021-021"],"award-info":[{"award-number":["GXXT-2021-021"]}]},{"name":"Science and Technology Plan Project of Wuhu","award":["2021yf49, 2022rkx07"],"award-info":[{"award-number":["2021yf49, 2022rkx07"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72101071 and 72071056"],"award-info":[{"award-number":["72101071 and 72071056"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017668","name":"Anhui Provincial Key Research and Development Plan","doi-asserted-by":"publisher","award":["2022a05020023"],"award-info":[{"award-number":["2022a05020023"]}],"id":[{"id":"10.13039\/501100017668","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Implementing green and sustainable development strategies has become essential for industrial robot manufacturing companies to fulfill their societal obligations. By enhancing assembly efficiency and minimizing energy consumption in workshops, these enterprises can differentiate themselves in the fiercely competitive market landscape and ultimately bolster their financial gains. Consequently, this study focuses on examining the collaborative assembly challenges associated with three crucial parts: the body, electrical cabinet, and pipeline pack, within the industrial robot manufacturing process. Considering the energy consumption during both active and idle periods of the industrial robot workshop assembly system, this paper presents a multi-stage energy-efficient scheduling model to minimize the total energy consumption. Two classes of heuristic algorithms are proposed to address this model. Our contribution is the restructuring of the existing complex mathematical programming model, based on the structural properties of scheduling sub-problems across multiple stages. This reformation not only effectively reduces the variable scale and eliminates redundant constraints, but also enables the Gurobi solver to tackle large-scale problems. Extensive experimental results indicate that compared to traditional workshop experience, the constructed green scheduling model and algorithm can provide more precise guidance for the assembly process in the workshop. Regarding total energy consumption, the assembly plans obtained through our designed model and algorithm exhibit approximately 3% lower energy consumption than conventional workshop experience-based approaches.<\/jats:p>","DOI":"10.1007\/s10462-023-10649-3","type":"journal-article","created":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T20:02:38Z","timestamp":1708113758000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Energy-efficient scheduling model and method for assembly blocking permutation flow-shop in industrial robotics field"],"prefix":"10.1007","volume":"57","author":[{"given":"Min","family":"Kong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yajing","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weizhong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muhammet","family":"Deveci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Seifedine","family":"Kadry","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,2,16]]},"reference":[{"issue":"1","key":"10649_CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.31181\/jscda11202314","volume":"1","author":"R Arabahmadi","year":"2023","unstructured":"Arabahmadi R, Mohammadi M, Samizadeh M, Rabbani M, Gharibi K (2023) Facility location optimization for technical inspection centers using multi-objective mathematical modeling considering uncertainty. J Soft Comput Decision Analyt 1(1):181\u2013208","journal-title":"J Soft Comput Decision Analyt"},{"key":"10649_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100557","author":"J Chen","year":"2019","unstructured":"Chen J, Wang L, Peng Z (2019) A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling. Swarm Evolut Comput. https:\/\/doi.org\/10.1016\/j.swevo.2019.100557","journal-title":"Swarm Evolut Comput"},{"key":"10649_CR3","unstructured":"Chinese National Bureau of statistics, DB (2022) National data. https:\/\/data.stats.gov.cn\/easyquery.htm?cn=C01&zb=A070O&sj=2022"},{"issue":"5","key":"10649_CR4","first-page":"428","volume":"29","author":"M Dai","year":"2013","unstructured":"Dai M, Tang D, Giret A, Salido MA, Li WD (2013) Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm. Robot Comput-Integ Manufact 29(5):428\u2013436","journal-title":"Robot Comput-Integ Manufact"},{"key":"10649_CR5","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105088","volume":"125","author":"J Ding","year":"2021","unstructured":"Ding J, Schulz S, Shen L, Buscher U, L\u00fc Z (2021) Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization. Comput Oper Res 125:105088","journal-title":"Comput Oper Res"},{"key":"10649_CR6","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1016\/j.ejor.2015.05.019","volume":"248","author":"J Ding","year":"2016","unstructured":"Ding J, Song S, Wu C (2016) Carbon-efficient scheduling of flow shops by multi-objective optimization. Eur J Oper Res 248:758\u2013771","journal-title":"Eur J Oper Res"},{"key":"10649_CR7","doi-asserted-by":"crossref","first-page":"14637","DOI":"10.1007\/s00500-020-04812-z","volume":"24","author":"AM Fard","year":"2020","unstructured":"Fard AM, Hajiaghaei-Keshteli M, Tavakkoli-Moghaddam R (2020) Red deer algorithm (RDA): a new nature-inspired meta-heuristic. Soft Comput 24:14637\u201314665","journal-title":"Soft Comput"},{"key":"10649_CR8","doi-asserted-by":"crossref","DOI":"10.1016\/j.jclepro.2019.118200","volume":"240","author":"AM Fathollahi-Fard","year":"2019","unstructured":"Fathollahi-Fard AM, Govindan K, Hajiaghaei-Keshteli M, Ahmadi A (2019) A green home health care supply chain: New modified simulated annealing algorithms. J Clean Prod 240:118200","journal-title":"J Clean Prod"},{"issue":"3","key":"10649_CR9","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":"10649_CR10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s40747-019-00122-6","volume":"6","author":"K Gao","year":"2020","unstructured":"Gao K, Huang Y, Sadollah A, Wang L (2020) A review of energy-efficient scheduling in intelligent production systems. Comp Intell Syst 6:237\u2013249","journal-title":"Comp Intell Syst"},{"key":"10649_CR11","first-page":"81","volume":"46","author":"A Garcia-Villoria","year":"2014","unstructured":"Garcia-Villoria A, Campo-Vecino J, Salhi S (2014) Flow shop scheduling with no-wait constraints: a constructive heuristic. Omega 46:81\u201391","journal-title":"Omega"},{"key":"10649_CR12","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"},{"key":"10649_CR13","doi-asserted-by":"crossref","DOI":"10.1016\/j.amc.2020.125533","volume":"386","author":"A Hasani","year":"2020","unstructured":"Hasani A, Hosseini SM (2020) A bi-objective flexible flow shop scheduling problem with machine-dependent processing stages: Trade-off between production costs and energy consumption. Appl Math Comput 386:125533","journal-title":"Appl Math Comput"},{"issue":"9","key":"10649_CR14","doi-asserted-by":"crossref","first-page":"5343","DOI":"10.1007\/s00521-018-3369-5","volume":"31","author":"M Hajiaghaei-Keshteli","year":"2019","unstructured":"Hajiaghaei-Keshteli M, Fathollahi Fard AM (2019) Sustainable closed-loop supply chain network design with discount supposition. Neural Comput Appl 31(9):5343\u20135377","journal-title":"Neural Comput Appl"},{"key":"10649_CR15","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107286","volume":"156","author":"M Kong","year":"2021","unstructured":"Kong M, Xu J, Zhang T, Lu S, Fang C, Mladenovic N (2021) Energy-efficient rescheduling with time-of-use energy cost: application of variable neighborhood search algorithm. Comput Ind Eng 156:107286","journal-title":"Comput Ind Eng"},{"issue":"1","key":"10649_CR16","doi-asserted-by":"crossref","first-page":"18","DOI":"10.31181\/jscda1120232","volume":"1","author":"S Kolahi-Randji","year":"2023","unstructured":"Kolahi-Randji S, Attari MYN, Ala A (2023) Enhancement the performance of multi-level and multi-commodity in supply chain: a simulation approach. J Soft Comput Decision Analyt 1(1):18\u201338","journal-title":"J Soft Comput Decision Analyt"},{"issue":"5","key":"10649_CR17","first-page":"475","volume":"19","author":"EL Lawler","year":"1973","unstructured":"Lawler EL (1973) Optimal sequencing of a single machine subject to precedence constraints. Manage Sci 19(5):475\u2013491","journal-title":"Manage Sci"},{"issue":"2","key":"10649_CR18","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/TEM.2017.2774281","volume":"65","author":"D Lei","year":"2017","unstructured":"Lei D, Gao L, Zheng Y (2017) A novel teaching-learning-based optimization algorithm for energy-efficient scheduling in hybrid flow shop. IEEE Trans Eng Manage 65(2):330\u2013340","journal-title":"IEEE Trans Eng Manage"},{"key":"10649_CR19","volume":"263","author":"D Lei","year":"2023","unstructured":"Lei D, Su B (2023) A multi-class teaching-learning-based optimization for multi-objective distributed hybrid flow shop scheduling. Knowl-Based Syst 263:110252","journal-title":"Knowl-Based Syst"},{"key":"10649_CR20","doi-asserted-by":"crossref","first-page":"33883","DOI":"10.1109\/ACCESS.2018.2840512","volume":"6","author":"J Li","year":"2018","unstructured":"Li J, Duan P, Sang H, Wang S, Liu Z, Duan P (2018a) An efficient optimization algorithm for resource-constrained steelmaking scheduling problems. IEEE Access 6:33883\u201333894","journal-title":"IEEE Access"},{"key":"10649_CR21","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.swevo.2019.05.006","volume":"49","author":"M Li","year":"2019","unstructured":"Li M, Lei D, Cai J (2019a) Two-level imperialist competitive algorithm for energy-efficient hybrid flow shop scheduling problem with relative importance of objectives. Swarm Evol Comput 49:34\u201343","journal-title":"Swarm Evol Comput"},{"key":"10649_CR22","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/j.jclepro.2014.04.016","volume":"96","author":"R Li","year":"2015","unstructured":"Li R, Chen M, Wang L (2015) Energy-efficient flow shop scheduling using a hybrid genetic algorithm. J Clean Prod 96:467\u2013478","journal-title":"J Clean Prod"},{"key":"10649_CR23","doi-asserted-by":"crossref","first-page":"5400","DOI":"10.1109\/TII.2018.2843441","volume":"14","author":"X Li","year":"2018","unstructured":"Li X, Lu C, Gao L, Xiao S, Wen L (2018b) An effective multiobjective algorithm for energy-efficient scheduling in a real-life welding shop. IEEE Trans Industr Inf 14:5400\u20135409","journal-title":"IEEE Trans Industr Inf"},{"key":"10649_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-019-00283-4","author":"X Li","year":"2019","unstructured":"Li X, Xiao S, Wang C, Yi J (2019) Mathematical modeling and a discrete artificial bee colony algorithm for the welding shop scheduling problem. Mem Comput. https:\/\/doi.org\/10.1007\/s12293-019-00283-4","journal-title":"Mem Comput"},{"key":"10649_CR25","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/j.jclepro.2017.01.011","volume":"144","author":"C Lu","year":"2017","unstructured":"Lu C, Gao L, Li X, Pan Q, Wang Q (2017) Energy-efficient permutation flow shop scheduling problem using a hybrid multi-objective backtracking search algorithm. J Clean Prod 144:228\u2013238","journal-title":"J Clean Prod"},{"key":"10649_CR26","volume":"74","author":"C Lu","year":"2022","unstructured":"Lu C, Huang Y, Meng L, Gao L, Zhang B, Zhou J (2022) A Pareto-based collaborative multi-objective optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers. Robot Comp-Integ Manufact 74:102277","journal-title":"Robot Comp-Integ Manufact"},{"key":"10649_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s11356-023-26986-3","author":"A Mokhtari-Moghadam","year":"2023","unstructured":"Mokhtari-Moghadam A, Pourhejazy P, Gupta D (2023) Integrating sustainability into production scheduling in hybrid flow-shop environments. Environ Sci Pollut Res Int. https:\/\/doi.org\/10.1007\/s11356-023-26986-3","journal-title":"Environ Sci Pollut Res Int"},{"key":"10649_CR28","doi-asserted-by":"crossref","first-page":"4247","DOI":"10.1080\/00207540701450013","volume":"45","author":"G Mouzon","year":"2007","unstructured":"Mouzon G, Yildirim MB, Twomey JM (2007) Operational methods for minimization of energy consumption of manufacturing equipment. Int J Prod Res 45:4247\u20134271","journal-title":"Int J Prod Res"},{"key":"10649_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2022.08.009","volume":"309","author":"JS Neufeld","year":"2022","unstructured":"Neufeld JS, Schulz S, Buscher U (2022) A systematic review of multi-objective hybrid flow shop scheduling. Eur J Oper Res 309:1\u201323","journal-title":"Eur J Oper Res"},{"issue":"5","key":"10649_CR30","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1080\/0305215X.2022.2032017","volume":"55","author":"W Niu","year":"2023","unstructured":"Niu W, Li JQ, Jin H, Qi R, Sang HY (2023) Bi-objective optimization using an improved NSGA-II for energy-efficient scheduling of a distributed assembly blocking flowshop. Eng Optim 55(5):719\u2013740","journal-title":"Eng Optim"},{"key":"10649_CR31","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113279","volume":"150","author":"H \u00d6ztop","year":"2020","unstructured":"\u00d6ztop H, Tasgetiren MF, Eliiyi DT, Pan Q, Kandiller L (2020a) An energy-efficient permutation flowshop scheduling problem. Expert Syst Appl 150:113279","journal-title":"Expert Syst Appl"},{"key":"10649_CR32","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100660","volume":"54","author":"H \u00d6ztop","year":"2020","unstructured":"\u00d6ztop H, Tasgetiren MF, Kandiller L, Eliiyi DT, Gao L (2020b) Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption. Swarm Evol Comput 54:100660","journal-title":"Swarm Evol Comput"},{"key":"10649_CR33","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TASE.2012.2204874","volume":"10","author":"Q Pan","year":"2013","unstructured":"Pan Q, Wang L, Mao K, Zhao J, Zhang M (2013) An effective artificial bee colony algorithm for a real-world hybrid flowshop problem in steelmaking process. IEEE Trans Autom Sci Eng 10:307\u2013322","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"10649_CR34","doi-asserted-by":"crossref","first-page":"2767","DOI":"10.1080\/00207543.2019.1656837","volume":"58","author":"Y Rao","year":"2020","unstructured":"Rao Y, Meng R, Zha J, Xu X (2020) Bi-objective mathematical model and improved algorithm for optimisation of welding shop scheduling problem. Int J Prod Res 58:2767\u20132783","journal-title":"Int J Prod Res"},{"key":"10649_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz R, Rodr\u00edguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205:1\u201318","journal-title":"Eur J Oper Res"},{"key":"10649_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2018.05.245","author":"N Sahebjamnia","year":"2018","unstructured":"Sahebjamnia N, Fathollahi-Fard AM, Hajiaghaei-Keshteli M (2018) Sustainable tire closed-loop supply chain network design: Hybrid metaheuristic algorithms for large-scale networks. J Clean Product. https:\/\/doi.org\/10.1016\/j.jclepro.2018.05.245","journal-title":"J Clean Product"},{"issue":"7","key":"10649_CR37","doi-asserted-by":"crossref","first-page":"1660","DOI":"10.1016\/j.simpat.2011.04.003","volume":"19","author":"B Shirazi","year":"2011","unstructured":"Shirazi B, Mahdavi I et al (2011) iCoSim-FMS: An intelligent co-simulator for the adaptive control of complex flexible manufacturing systems. Simul Model Pract Theory 19(7):1660\u20131688","journal-title":"Simul Model Pract Theory"},{"key":"10649_CR38","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.jmsy.2021.05.012","volume":"60","author":"S Zhang","year":"2021","unstructured":"Zhang S, Yangbing Xu, Zhang W (2021) Multitask-oriented manufacturing service composition in an uncertain environment using a hyper-heuristic algorithm. J Manuf Syst 60:138\u2013151","journal-title":"J Manuf Syst"},{"key":"10649_CR39","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s40747-020-00193-w","volume":"7","author":"X Tao","year":"2020","unstructured":"Tao X, Li J, Huang T, Duan P (2020) Discrete imperialist competitive algorithm for the resource-constrained hybrid flowshop problem with energy consumption. Comp Intell Syst 7:311\u2013326","journal-title":"Comp Intell Syst"},{"key":"10649_CR40","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1080\/00207543.2014.933273","volume":"53","author":"A Tiwari","year":"2015","unstructured":"Tiwari A, Chang PC, Tiwari MK, Kollanoor NJ (2015) A Pareto block-based estimation and distribution algorithm for multi-objective permutation flow shop scheduling problem. Int J Prod Res 53:793\u2013834","journal-title":"Int J Prod Res"},{"key":"10649_CR41","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.4008763","author":"DM Utama","year":"2023","unstructured":"Utama DM, Primayesti MD, Umamy SZ, Kholifa BM, Yasa AD (2023) A systematic literature review on energy-efficient hybrid flow shop scheduling. Cogent Eng. https:\/\/doi.org\/10.2139\/ssrn.4008763","journal-title":"Cogent Eng"},{"key":"10649_CR42","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10479-021-03952-1","volume":"310","author":"G Wang","year":"2021","unstructured":"Wang G, Li X, Gao L, Li P (2021) An effective multi-objective whale swarm algorithm for energy-efficient scheduling of distributed welding flow shop. Ann Oper Res 310:223\u2013255","journal-title":"Ann Oper Res"},{"key":"10649_CR43","doi-asserted-by":"crossref","first-page":"2283","DOI":"10.1080\/00207543.2019.1624857","volume":"58","author":"S Wang","year":"2019","unstructured":"Wang S, Wang X, Chu F, Yu J (2019) An energy-efficient two-stage hybrid flow shop scheduling problem in a glass production. Int J Prod Res 58:2283\u20132314","journal-title":"Int J Prod Res"},{"key":"10649_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2022.135738","author":"Z Wang","year":"2022","unstructured":"Wang Z, Shen L, Li X, Gao L (2022) An improved multi-objective firefly algorithm for energy-efficient hybrid flowshop rescheduling problem. J Clean Product. https:\/\/doi.org\/10.1016\/j.jclepro.2022.135738","journal-title":"J Clean Product"},{"key":"10649_CR45","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106431","volume":"145","author":"D Y\u00fcksel","year":"2020","unstructured":"Y\u00fcksel D, Tasgetiren MF, Kandiller L, Gao L (2020) An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption. Comput Ind Eng 145:106431","journal-title":"Comput Ind Eng"},{"key":"10649_CR46","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.cie.2019.07.036","volume":"136","author":"B Zhang","year":"2019","unstructured":"Zhang B, Pan Q, Gao L, Li X, Meng L, Peng K (2019) A multiobjective evolutionary algorithm based on decomposition for hybrid flowshop green scheduling problem. Comput Ind Eng 136:325\u2013344","journal-title":"Comput Ind Eng"},{"key":"10649_CR47","doi-asserted-by":"crossref","first-page":"4984","DOI":"10.1109\/TSMC.2019.2916088","volume":"50","author":"B Zhang","year":"2020","unstructured":"Zhang B, Pan Q, Gao L, Meng L, Li X, Peng K (2020a) A three-stage multiobjective approach based on decomposition for an energy-efficient hybrid flow shop scheduling problem. IEEE Trans Syst, Man, Cybernet 50:4984\u20134999","journal-title":"IEEE Trans Syst, Man, Cybernet"},{"key":"10649_CR48","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.asoc.2016.12.021","volume":"52","author":"B Zhang","year":"2017","unstructured":"Zhang B, Pan Q, Gao L, Zhang X, Sang H, Li J (2017) An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming. Appl Soft Comput 52:14\u201327","journal-title":"Appl Soft Comput"},{"key":"10649_CR49","doi-asserted-by":"crossref","first-page":"3361","DOI":"10.1016\/j.jclepro.2015.09.097","volume":"112","author":"R Zhang","year":"2016","unstructured":"Zhang R, Chiong R (2016) Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption. J Clean Prod 112:3361\u20133375","journal-title":"J Clean Prod"},{"issue":"5","key":"10649_CR50","first-page":"116","volume":"200","author":"X Zhang","year":"2022","unstructured":"Zhang X, Liu X, Cichon A, Kr\u00f3lczyk G, Li Z (2022) Scheduling of energy-efficient distributed blocking flowshop using pareto-based estimation of distribution algorithm. Expert Syst Appl 200(5):116\u2013910","journal-title":"Expert Syst Appl"},{"key":"10649_CR51","volume":"60","author":"Z Zhang","year":"2020","unstructured":"Zhang Z, Qian B, Hu R, Jin H, Wang L (2020b) A matrix-cube-based estimation of distribution algorithm for the distributed assembly permutation flow-shop scheduling problem. Swarm Evol Comput 60:100785","journal-title":"Swarm Evol Comput"},{"key":"10649_CR52","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.4135650","author":"F Zhao","year":"2023","unstructured":"Zhao F, Xu Z, Hu X, Xu T, Zhu N, Jonrinaldi, (2023) An improved iterative greedy algorithm for energy-efficient distributed assembly no-wait flow-shop scheduling problem. Swarm Evolut Comput. https:\/\/doi.org\/10.2139\/ssrn.4135650","journal-title":"Swarm Evolut Comput"},{"key":"10649_CR53","doi-asserted-by":"crossref","first-page":"8588","DOI":"10.1109\/TII.2022.3220860","volume":"19","author":"F Zhao","year":"2023","unstructured":"Zhao F, Zhang HQ, Wang L (2023b) A Pareto-based discrete Jaya algorithm for multiobjective carbon-efficient distributed blocking flow shop scheduling problem. IEEE Trans Industr Inf 19:8588\u20138599","journal-title":"IEEE Trans Industr Inf"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-023-10649-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10462-023-10649-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-023-10649-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T09:21:13Z","timestamp":1709630473000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10462-023-10649-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,16]]},"references-count":53,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,3]]}},"alternative-id":["10649"],"URL":"https:\/\/doi.org\/10.1007\/s10462-023-10649-3","relation":{},"ISSN":["1573-7462"],"issn-type":[{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,16]]},"assertion":[{"value":"19 December 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2024","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 article does not contain any studies with animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}],"article-number":"60"}}