{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T06:28:40Z","timestamp":1768372120285,"version":"3.49.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T00:00:00Z","timestamp":1668816000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T00:00:00Z","timestamp":1668816000000},"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":["Neural Comput & Applic"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s00521-022-08012-8","type":"journal-article","created":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T16:04:58Z","timestamp":1668873898000},"page":"6361-6381","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Energy-efficient distributed heterogeneous blocking flowshop scheduling problem using a knowledge-based iterated Pareto greedy algorithm"],"prefix":"10.1007","volume":"35","author":[{"given":"Shuai","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5022-7946","authenticated-orcid":false,"given":"Quan-Ke","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Liang","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Zhong-Hua","family":"Miao","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,19]]},"reference":[{"key":"8012_CR1","unstructured":"Gielen D, Bennaceur K, Kerr T, Tam C, Tanaka K, Taylor M, Taylor P (2007) IEA, tracking industrial energy efficiency and CO2 emissions"},{"issue":"2","key":"8012_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s40747-019-00122-6","volume":"6","author":"KZ Gao","year":"2020","unstructured":"Gao KZ, Huang Y, Sadollah A, Wang L (2020) A review of energy-efficient scheduling in intelligent production systems. Complex Intell Syst 6(2):237\u2013249. https:\/\/doi.org\/10.1007\/s40747-019-00122-6","journal-title":"Complex Intell Syst"},{"key":"8012_CR3","doi-asserted-by":"publisher","first-page":"113279","DOI":"10.1016\/j.eswa.2020.113279","volume":"150","author":"H \u00d6ztop","year":"2020","unstructured":"\u00d6ztop H, Tasgetiren MF, Eliiyi DT, Pan Q-K, Kandiller L (2020) An energy-efficient permutation flowshop scheduling problem. Expert Syst Appl 150:113279. https:\/\/doi.org\/10.1016\/j.eswa.2020.113279","journal-title":"Expert Syst Appl"},{"issue":"12","key":"8012_CR4","doi-asserted-by":"publisher","first-page":"4984","DOI":"10.1109\/tsmc.2019.2916088","volume":"50","author":"B Zhang","year":"2020","unstructured":"Zhang B, Pan Q-K, Gao L, Meng L-L, Li X-Y, Peng K-K (2020) A three-stage multiobjective approach based on decomposition for an energy-efficient hybrid flow shop scheduling problem. IEEE Trans Syst Man Cybern-Syst 50(12):4984\u20134999. https:\/\/doi.org\/10.1109\/tsmc.2019.2916088","journal-title":"IEEE Trans Syst Man Cybern-Syst"},{"issue":"3","key":"8012_CR5","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.ejor.2015.05.019","journal-title":"Eur J Oper Res"},{"issue":"2","key":"8012_CR6","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1109\/tem.2017.2774281","volume":"65","author":"D Lei","year":"2018","unstructured":"Lei D, Gao L, Zheng Y (2018) A novel teaching-learning-based optimization algorithm for energy-efficient scheduling in hybrid flow shop. IEEE Trans Eng Manag 65(2):330\u2013340. https:\/\/doi.org\/10.1109\/tem.2017.2774281","journal-title":"IEEE Trans Eng Manag"},{"key":"8012_CR7","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1016\/j.jclepro.2019.06.151","volume":"234","author":"S Luo","year":"2019","unstructured":"Luo S, Zhang L, Fan Y (2019) Energy-efficient scheduling for multi-objective flexible job shops with variable processing speeds by grey wolf optimization. J Clean Prod 234:1365\u20131384. https:\/\/doi.org\/10.1016\/j.jclepro.2019.06.151","journal-title":"J Clean Prod"},{"key":"8012_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","volume":"83","author":"R Ruiz","year":"2019","unstructured":"Ruiz R, Pan Q-K, Naderi B (2019) Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega-Int J Manag Sci 83:213\u2013222. https:\/\/doi.org\/10.1016\/j.omega.2018.03.004","journal-title":"Omega-Int J Manag Sci"},{"key":"8012_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100804","author":"T Meng","year":"2020","unstructured":"Meng T, Pan Q-K (2020) A distributed heterogeneous permutation flowshop scheduling problem with lot-streaming and carryover sequence-dependent setup time. Swarm Evol Comput. https:\/\/doi.org\/10.1016\/j.swevo.2020.100804","journal-title":"Swarm Evol Comput"},{"key":"8012_CR10","doi-asserted-by":"publisher","first-page":"104016","DOI":"10.1016\/j.engappai.2020.104016","volume":"97","author":"J-P Huang","year":"2021","unstructured":"Huang J-P, Pan Q-K, Miao Z-H, Gao L (2021) Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times. Eng Appl Artif Intell 97:104016. https:\/\/doi.org\/10.1016\/j.engappai.2020.104016","journal-title":"Eng Appl Artif Intell"},{"issue":"4","key":"8012_CR11","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1016\/j.cor.2009.06.019","volume":"37","author":"B Naderi","year":"2010","unstructured":"Naderi B, Ruiz R (2010) The distributed permutation flowshop scheduling problem. Comput Oper Res 37(4):754\u2013768. https:\/\/doi.org\/10.1016\/j.cor.2009.06.019","journal-title":"Comput Oper Res"},{"key":"8012_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.eswa.2017.01.006","volume":"74","author":"I Ribas","year":"2017","unstructured":"Ribas I, Companys R, Tort-Martorell X (2017) Efficient heuristics for the parallel blocking flow shop scheduling problem. Expert Syst Appl 74:41\u201354. https:\/\/doi.org\/10.1016\/j.eswa.2017.01.006","journal-title":"Expert Syst Appl"},{"key":"8012_CR13","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.cie.2017.06.025","volume":"110","author":"K-C Ying","year":"2017","unstructured":"Ying K-C, Lin S-W, Cheng C-Y, He C-D (2017) Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems. Comput Ind Eng 110:413\u2013423. https:\/\/doi.org\/10.1016\/j.cie.2017.06.025","journal-title":"Comput Ind Eng"},{"key":"8012_CR14","doi-asserted-by":"publisher","first-page":"114495","DOI":"10.1016\/j.eswa.2020.114495","volume":"169","author":"JY Mao","year":"2021","unstructured":"Mao JY, Pan QK, Miao ZH, Gao L (2021) An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance. Expert Syst Appl 169:114495. https:\/\/doi.org\/10.1016\/j.eswa.2020.114495","journal-title":"Expert Syst Appl"},{"key":"8012_CR15","doi-asserted-by":"publisher","first-page":"100742","DOI":"10.1016\/j.swevo.2020.100742","volume":"59","author":"J-P Huang","year":"2020","unstructured":"Huang J-P, Pan Q-K, Gao L (2020) An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times. Swarm Evol Comput 59:100742. https:\/\/doi.org\/10.1016\/j.swevo.2020.100742","journal-title":"Swarm Evol Comput"},{"key":"8012_CR16","doi-asserted-by":"crossref","unstructured":"Chen J, Wang L, He X, Huang D (2019) A probability model-based memetic algorithm for distributed heterogeneous flow-shop scheduling. In: 2019 IEEE congress on evolutionary computation (CEC). pp 411\u2013418","DOI":"10.1109\/CEC.2019.8790051"},{"key":"8012_CR17","doi-asserted-by":"publisher","first-page":"106946","DOI":"10.1016\/j.asoc.2020.106946","volume":"100","author":"H Li","year":"2021","unstructured":"Li H, Li X, Gao L (2021) A discrete artificial bee colony algorithm for the distributed heterogeneous no-wait flowshop scheduling problem. Appl Soft Comput 100:106946. https:\/\/doi.org\/10.1016\/j.asoc.2020.106946","journal-title":"Appl Soft Comput"},{"issue":"1","key":"8012_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0925-5273(03)00065-3","volume":"87","author":"DP Ronconi","year":"2004","unstructured":"Ronconi DP (2004) A note on constructive heuristics for the flowshop problem with blocking. Int J Prod Econ 87(1):39\u201348. https:\/\/doi.org\/10.1016\/S0925-5273(03)00065-3","journal-title":"Int J Prod Econ"},{"issue":"5","key":"8012_CR19","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1016\/j.cor.2009.08.001","volume":"37","author":"H Gong","year":"2010","unstructured":"Gong H, Tang L, Duin CW (2010) A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times. Comput Oper Res 37(5):960\u2013969. https:\/\/doi.org\/10.1016\/j.cor.2009.08.001","journal-title":"Comput Oper Res"},{"issue":"3","key":"8012_CR20","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0377-2217(99)00224-6","volume":"125","author":"J Grabowski","year":"2000","unstructured":"Grabowski J, Pempera J (2000) Sequencing of jobs in some production system. Eur J Oper Res 125(3):535\u2013550. https:\/\/doi.org\/10.1016\/S0377-2217(99)00224-6","journal-title":"Eur J Oper Res"},{"key":"8012_CR21","doi-asserted-by":"publisher","first-page":"15694","DOI":"10.1109\/access.2017.2732738","volume":"5","author":"K-C Ying","year":"2017","unstructured":"Ying K-C, Lin S-W (2017) Minimizing makespan in distributed blocking flowshops using hybrid iterated greedy algorithms. IEEE Access 5:15694\u201315705. https:\/\/doi.org\/10.1109\/access.2017.2732738","journal-title":"IEEE Access"},{"key":"8012_CR22","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.engappai.2018.09.005","volume":"76","author":"G Zhang","year":"2018","unstructured":"Zhang G, Xing K, Cao F (2018) Discrete differential evolution algorithm for distributed blocking flowshop scheduling with makespan criterion. Eng Appl Artif Intell 76:96\u2013107. https:\/\/doi.org\/10.1016\/j.engappai.2018.09.005","journal-title":"Eng Appl Artif Intell"},{"key":"8012_CR23","doi-asserted-by":"publisher","first-page":"113147","DOI":"10.1016\/j.eswa.2019.113147","volume":"145","author":"Z Shao","year":"2020","unstructured":"Shao Z, Pi D, Shao W (2020) Hybrid enhanced discrete fruit fly optimization algorithm for scheduling blocking flow-shop in distributed environment. Expert Syst Appl 145:113147. https:\/\/doi.org\/10.1016\/j.eswa.2019.113147","journal-title":"Expert Syst Appl"},{"key":"8012_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113678","author":"F Zhao","year":"2020","unstructured":"Zhao F, Zhao L, Wang L, Song H (2020) An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2020.113678","journal-title":"Expert Syst Appl"},{"key":"8012_CR25","doi-asserted-by":"publisher","first-page":"102155","DOI":"10.1016\/j.rcim.2021.102155","volume":"71","author":"S Chen","year":"2021","unstructured":"Chen S, Pan Q-K, Gao L (2021) Production scheduling for blocking flowshop in distributed environment using effective heuristics and iterated greedy algorithm. Robot Comput-Integr Manuf 71:102155. https:\/\/doi.org\/10.1016\/j.rcim.2021.102155","journal-title":"Robot Comput-Integr Manuf"},{"key":"8012_CR26","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.eswa.2018.12.039","volume":"121","author":"I Ribas","year":"2019","unstructured":"Ribas I, Companys R, Tort-Martorell X (2019) An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem. Expert Syst Appl 121:347\u2013361. https:\/\/doi.org\/10.1016\/j.eswa.2018.12.039","journal-title":"Expert Syst Appl"},{"key":"8012_CR27","doi-asserted-by":"publisher","first-page":"108366","DOI":"10.1016\/j.cie.2022.108366","volume":"171","author":"HH Miyata","year":"2022","unstructured":"Miyata HH, Nagano MS (2022) An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan. Comput Ind Eng 171:108366. https:\/\/doi.org\/10.1016\/j.cie.2022.108366","journal-title":"Comput Ind Eng"},{"key":"8012_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109502","author":"X Han","year":"2022","unstructured":"Han X, Han Y, Zhang B, Qin H, Li J, Liu Y, Gong D (2022) An effective iterative greedy algorithm for distributed blocking flowshop scheduling problem with balanced energy costs criterion. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2022.109502","journal-title":"Appl Soft Comput"},{"key":"8012_CR29","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2022.3174915","author":"Z Shao","year":"2022","unstructured":"Shao Z, Shao W, Pi D (2022) LS-HH: a learning-based selection hyper-heuristic for distributed heterogeneous hybrid blocking flow-shop scheduling. IEEE Trans Emerg Top Comput Intell. https:\/\/doi.org\/10.1109\/TETCI.2022.3174915","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"key":"8012_CR30","doi-asserted-by":"crossref","unstructured":"Deng J, Wang L, Wu C, Wang J, Zheng X (2016) A competitive memetic algorithm for carbon-efficient scheduling of distributed flow-shop. In: 2016 international conference on intelligent computing. pp 476\u2013488","DOI":"10.1007\/978-3-319-42291-6_48"},{"issue":"5","key":"8012_CR31","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1109\/tsmc.2017.2788879","volume":"50","author":"J-J Wang","year":"2020","unstructured":"Wang J-J, Wang L (2020) A knowledge-based cooperative algorithm for energy-efficient scheduling of distributed flow-shop. IEEE Trans Syst Man Cybern-Syst 50(5):1805\u20131819. https:\/\/doi.org\/10.1109\/tsmc.2017.2788879","journal-title":"IEEE Trans Syst Man Cybern-Syst"},{"key":"8012_CR32","doi-asserted-by":"publisher","first-page":"100557","DOI":"10.1016\/j.swevo.2019.100557","volume":"50","author":"J-F Chen","year":"2019","unstructured":"Chen J-F, Wang L, Peng Z-P (2019) A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling. Swarm Evol Comput 50:100557. https:\/\/doi.org\/10.1016\/j.swevo.2019.100557","journal-title":"Swarm Evol Comput"},{"key":"8012_CR33","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.3026571","author":"Z Pan","year":"2020","unstructured":"Pan Z, Lei D, Wang L (2020) A knowledge-based two-population optimization algorithm for distributed energy-efficient parallel machines scheduling. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/TCYB.2020.3026571","journal-title":"IEEE Trans Cybern"},{"key":"8012_CR34","doi-asserted-by":"publisher","first-page":"100745","DOI":"10.1016\/j.swevo.2020.100745","volume":"58","author":"E-D Jiang","year":"2020","unstructured":"Jiang E-D, Wang L, Peng Z-P (2020) Solving energy-efficient distributed job shop scheduling via multi-objective evolutionary algorithm with decomposition. Swarm Evol Comput 58:100745. https:\/\/doi.org\/10.1016\/j.swevo.2020.100745","journal-title":"Swarm Evol Comput"},{"key":"8012_CR35","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1007\/s10479-021-03952-1","journal-title":"Ann Oper Res"},{"issue":"4","key":"8012_CR36","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/s00291-007-0098-z","volume":"30","author":"JM Framinan","year":"2008","unstructured":"Framinan JM, Leisten R (2008) A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria. Or Spectr 30(4):787\u2013804. https:\/\/doi.org\/10.1007\/s00291-007-0098-z","journal-title":"Or Spectr"},{"issue":"11","key":"8012_CR37","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1016\/j.cor.2011.01.010","volume":"38","author":"G Minella","year":"2011","unstructured":"Minella G, Ruiz R, Ciavotta M (2011) Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems. Comput Oper Res 38(11):1521\u20131533. https:\/\/doi.org\/10.1016\/j.cor.2011.01.010","journal-title":"Comput Oper Res"},{"key":"8012_CR38","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.inffus.2021.10.002","volume":"79","author":"W Li","year":"2022","unstructured":"Li W, Zhou X, Yang C, Fan Y, Wang Z, Liu Y (2022) Multi-objective optimization algorithm based on characteristics fusion of dynamic social networks for community discovery. Inf Fusion 79:110\u2013123. https:\/\/doi.org\/10.1016\/j.inffus.2021.10.002","journal-title":"Inf Fusion"},{"issue":"1","key":"8012_CR39","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91\u201395. https:\/\/doi.org\/10.1016\/0305-0483(83)90088-9","journal-title":"Omega"},{"issue":"6","key":"8012_CR40","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garcia","year":"2009","unstructured":"Garcia S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the CEC\u20192005 special session on real parameter optimization. J Heuristics 15(6):617\u2013644. https:\/\/doi.org\/10.1007\/s10732-008-9080-4","journal-title":"J Heuristics"},{"key":"8012_CR41","doi-asserted-by":"crossref","unstructured":"Goh CK, Ong Y, Tan K (2009) Multi-objective memetic algorithms","DOI":"10.1007\/978-3-540-88051-6"},{"key":"8012_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5555\/1248547.1248548","volume":"7","author":"J Demsar","year":"2006","unstructured":"Demsar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330. https:\/\/doi.org\/10.5555\/1248547.1248548","journal-title":"J Mach Learn Res"},{"issue":"3","key":"8012_CR43","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s40305-017-0165-3","volume":"6","author":"S Cai","year":"2018","unstructured":"Cai S, Yang K, Liu K (2018) Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints. J Oper Res Soc China 6(3):391\u2013416. https:\/\/doi.org\/10.1007\/s40305-017-0165-3","journal-title":"J Oper Res Soc China"},{"issue":"6","key":"8012_CR44","doi-asserted-by":"publisher","first-page":"1756","DOI":"10.1080\/00207543.2018.1504251","volume":"57","author":"ED Jiang","year":"2019","unstructured":"Jiang ED, Wang L (2019) An improved multi-objective evolutionary algorithm based on decomposition for energy-efficient permutation flow shop scheduling problem with sequence-dependent setup time. Int J Prod Res 57(6):1756\u20131771. https:\/\/doi.org\/10.1080\/00207543.2018.1504251","journal-title":"Int J Prod Res"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-08012-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-08012-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-08012-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,28]],"date-time":"2023-02-28T20:25:55Z","timestamp":1677615955000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-08012-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,19]]},"references-count":44,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["8012"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-08012-8","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,19]]},"assertion":[{"value":"8 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2022","order":3,"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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}