{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T04:04:19Z","timestamp":1746763459302,"version":"3.40.5"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"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":["J Supercomput"],"DOI":"10.1007\/s11227-025-07293-9","type":"journal-article","created":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T14:18:20Z","timestamp":1746713900000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-objective scheduling of heterogeneous parallel systems using the VITS algorithm"],"prefix":"10.1007","volume":"81","author":[{"given":"Saeedeh","family":"Bakhoda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Abdollahi Azgomi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Reza","family":"Ebrahimi Dishabi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,8]]},"reference":[{"issue":"1","key":"7293_CR1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10951-021-00711-9","volume":"25","author":"H Krim","year":"2022","unstructured":"Krim H, Zufferey N, Potvin JY, Benmansour R, Duvivier D (2022) Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and the weighted sum of completion times. J Sched 25(1):89\u2013105. https:\/\/doi.org\/10.1007\/s10951-021-00711-9","journal-title":"J Sched"},{"key":"7293_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.cor.2018.12.016","volume":"104","author":"S Wang","year":"2019","unstructured":"Wang S, Ye B (2019) Exact methods for order acceptance and scheduling on unrelated parallel machines. Comput Oper Res 104:159\u2013173. https:\/\/doi.org\/10.1016\/j.cor.2018.12.016","journal-title":"Comput Oper Res"},{"issue":"1","key":"7293_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJHPCN.2018.088874","volume":"11","author":"KC Huang","year":"2018","unstructured":"Huang KC, Hung CH, Hsieh W (2018) Revenue maximization for scheduling deadline-constrained mouldable jobs on high-performance computing as a service platform. Int J High Perform Comput Netw 11(1):1\u201313. https:\/\/doi.org\/10.1504\/IJHPCN.2018.088874","journal-title":"Int J High Perform Comput Netw"},{"key":"7293_CR4","doi-asserted-by":"publisher","unstructured":"Juraszek J, Sterna M (2009) Revenue maximization on parallel machines. In: Operations Research Proceedings, pp 0\u201321. https:\/\/doi.org\/10.1007\/978-3-642-00142-0","DOI":"10.1007\/978-3-642-00142-0"},{"issue":"1","key":"7293_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/IJCAC.2022010105","volume":"12","author":"J Bisht","year":"2022","unstructured":"Bisht J, Vampugani VS (2022) Load and cost-aware min-min workflow scheduling algorithm for heterogeneous resources in fog, cloud, and edge scenarios. Int J Cloud Appl Comput (IJCAC) 12(1):1\u201320. https:\/\/doi.org\/10.4018\/IJCAC.2022010105","journal-title":"Int J Cloud Appl Comput (IJCAC)"},{"issue":"3","key":"7293_CR6","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1504\/IJCNDS.2013.056227","volume":"11","author":"GM Siddesh","year":"2013","unstructured":"Siddesh GM, Srinivasa KG (2013) SLA-driven dynamic capacity forecasting and resource allocation with risk analysis on clouds. Int J Commun Netw Distrib Syst (IJCNDS) 11(3):327\u2013346. https:\/\/doi.org\/10.1504\/IJCNDS.2013.056227","journal-title":"Int J Commun Netw Distrib Syst (IJCNDS)"},{"issue":"1","key":"7293_CR7","doi-asserted-by":"publisher","first-page":"40","DOI":"10.71346\/utj.v1i1.11","volume":"1","author":"A Aslam","year":"2025","unstructured":"Aslam A, Anuarovna ZD (2025) Real-time workload prediction and resource optimization for parallel heterogeneous high-performance computing systems architectures. Ubiquitous Technol J 1(1):40\u201347. https:\/\/doi.org\/10.71346\/utj.v1i1.11","journal-title":"Ubiquitous Technol J"},{"issue":"14","key":"7293_CR8","doi-asserted-by":"publisher","first-page":"8537","DOI":"10.3390\/app13148537","volume":"13","author":"N Lotfi","year":"2023","unstructured":"Lotfi N, Ghadiri Nejad M (2023) A new hybrid algorithm based on improved mode and pf neighborhood search for scheduling task graphs in heterogeneous distributed systems. Appl Sci 13(14):8537. https:\/\/doi.org\/10.3390\/app13148537","journal-title":"Appl Sci"},{"key":"7293_CR9","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.cie.2017.09.042","volume":"113","author":"W Bozejko","year":"2017","unstructured":"Bozejko W, Gnatowski A, Pempera J, Wodecki M (2017) Parallel tabu search for the cyclic job shop scheduling problem. Comput Ind Eng 113:512\u2013524. https:\/\/doi.org\/10.1016\/j.cie.2017.09.042","journal-title":"Comput Ind Eng"},{"key":"7293_CR10","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2025.3536317","author":"K Cai","year":"2025","unstructured":"Cai K, Wu Q, Zhou M, Chen C, Wen J, Wang S (2025) Dynamically scheduling deadline-constrained interleaved workflows on heterogeneous computing systems. IEEE Trans Serv Comput. https:\/\/doi.org\/10.1109\/TSC.2025.3536317","journal-title":"IEEE Trans Serv Comput"},{"key":"7293_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2021.107915","volume":"165","author":"C Chen","year":"2022","unstructured":"Chen C, Fathi M, Khakifirooz M, Wu K (2022) Hybrid tabu search algorithm for unrelated parallel machine scheduling in semiconductor fabs with setup times, job release, and expired times. Comput Ind Eng 165:1\u201311. https:\/\/doi.org\/10.1016\/j.cie.2021.107915","journal-title":"Comput Ind Eng"},{"issue":"1","key":"7293_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/IJSSCI.312559","volume":"14","author":"S Singh","year":"2022","unstructured":"Singh S, Kumar R, Rao UP (2022) Multi-objective adaptive manta-ray foraging optimization for workflow scheduling with selected virtual machines using time-series-based prediction. Int J Softw Sci Comput Intell (IJSSCI) 14(1):1\u201325. https:\/\/doi.org\/10.4018\/IJSSCI.312559","journal-title":"Int J Softw Sci Comput Intell (IJSSCI)"},{"issue":"4","key":"7293_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.4018\/jdst.2012100106","volume":"3","author":"GM Siddesh","year":"2012","unstructured":"Siddesh GM, Srinisas KG (2012) An adaptive scheduler framework for complex workflow jobs on grid systems. Int J Distrib Syst Technol (IJDST) 3(4):63\u201378. https:\/\/doi.org\/10.4018\/jdst.2012100106","journal-title":"Int J Distrib Syst Technol (IJDST)"},{"issue":"4","key":"7293_CR14","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1080\/17509653.2021.1941368","volume":"16","author":"M Hajibabaei","year":"2021","unstructured":"Hajibabaei M, Behnamian J (2021) Flexible job-shop scheduling problem with unrelated parallel machines and resources-dependent processing times: a tabu search algorithm. Int J Manag Sci Eng Manag 16(4):242\u2013253. https:\/\/doi.org\/10.1080\/17509653.2021.1941368","journal-title":"Int J Manag Sci Eng Manag"},{"issue":"9","key":"7293_CR15","doi-asserted-by":"publisher","first-page":"7459","DOI":"10.1016\/j.jksuci.2021.08.025","volume":"34","author":"MS Umam","year":"2022","unstructured":"Umam MS, Mustafid M, Suryono S (2022) A hybrid genetic algorithm and tabu search for minimizing Makespan in flow shop scheduling problem. J. King Saud Univ. Comput Inf Sci 34(9):7459\u20137467. https:\/\/doi.org\/10.1016\/j.jksuci.2021.08.025","journal-title":"J. King Saud Univ. Comput Inf Sci"},{"issue":"4","key":"7293_CR16","doi-asserted-by":"publisher","first-page":"3369","DOI":"10.1007\/s13369-018-3525-3","volume":"44","author":"K Ben","year":"2019","unstructured":"Ben K, Hadad H, Korbaa O (2019) An improved tabu search meta-heuristic approach for solving scheduling problem with non-availability constraints. Arab J Sci Eng 44(4):3369\u20133379. https:\/\/doi.org\/10.1007\/s13369-018-3525-3","journal-title":"Arab J Sci Eng"},{"issue":"6","key":"7293_CR17","doi-asserted-by":"publisher","first-page":"3279","DOI":"10.1007\/s13369-017-3047-4","volume":"43","author":"H Dai","year":"2018","unstructured":"Dai H, Cheng W, Guo P (2018) An improved tabu search for multi-skill resource-constrained project scheduling problems under step-deterioration. Arab J Sci Eng 43(6):3279\u20133290. https:\/\/doi.org\/10.1007\/s13369-017-3047-4","journal-title":"Arab J Sci Eng"},{"issue":"12","key":"7293_CR18","doi-asserted-by":"publisher","first-page":"7994","DOI":"10.1007\/s11227-019-02936-0","volume":"75","author":"H Alazzam","year":"2019","unstructured":"Alazzam H, Alhenawi E, Al R (2019) A hybrid job scheduling algorithm based on tabu and harmony search algorithms. J Supercomput 75(12):7994\u20138011. https:\/\/doi.org\/10.1007\/s11227-019-02936-0","journal-title":"J Supercomput"},{"issue":"4","key":"7293_CR19","doi-asserted-by":"publisher","first-page":"26","DOI":"10.2478\/cait-2019-0034","volume":"19","author":"A Toshev","year":"2019","unstructured":"Toshev A (2019) Particle swarm optimization and tabu search hybrid algorithm for flexible job shop scheduling problem\u2013analysis of test results. Cybern Inf Technol 19(4):26\u201344. https:\/\/doi.org\/10.2478\/cait-2019-0034","journal-title":"Cybern Inf Technol"},{"key":"7293_CR20","doi-asserted-by":"publisher","DOI":"10.1145\/3711849","author":"J Chen","year":"2025","unstructured":"Chen J, Wang Y, Zhang Y, Lu Y, Li Q, Shu Q (2025) Non-preemptive scheduling of periodic tasks with data dependencies in heterogeneous multiprocessor embedded systems. ACM Trans Des Autom of Electron Syst. https:\/\/doi.org\/10.1145\/3711849","journal-title":"ACM Trans Des Autom of Electron Syst"},{"issue":"1","key":"7293_CR21","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1186\/s13677-024-00670-4","volume":"13","author":"Z Zhang","year":"2024","unstructured":"Zhang Z, Xu CH, Xu SH, Huang L, Zhang J (2024) Towards optimized scheduling and allocation of heterogeneous resource via graph-enhanced EPSO algorithm. J Cloud Comput 13(1):108. https:\/\/doi.org\/10.1186\/s13677-024-00670-4","journal-title":"J Cloud Comput"},{"key":"7293_CR22","doi-asserted-by":"publisher","first-page":"7812","DOI":"10.1007\/s11227-023-05725-y","volume":"80","author":"S Rostami","year":"2024","unstructured":"Rostami S, Broumandnia A, Khademzadeh A (2024) An energy-efficient task scheduling method for heterogeneous cloud computing systems using capuchin search and inverted ant colony optimization algorithm. J Supercomput 80:7812\u20137848. https:\/\/doi.org\/10.1007\/s11227-023-05725-y","journal-title":"J Supercomput"},{"key":"7293_CR23","doi-asserted-by":"publisher","first-page":"56027","DOI":"10.1109\/ACCESS.2023.3278372","volume":"11","author":"A Momenikorbekandi","year":"2023","unstructured":"Momenikorbekandi A, Abbod MF (2023) A novel metaheuristic hybrid parthenogenetic algorithm for job shop scheduling problems: applying an optimization model. IEEE 11:56027\u201356045. https:\/\/doi.org\/10.1109\/ACCESS.2023.3278372","journal-title":"IEEE"},{"key":"7293_CR24","doi-asserted-by":"publisher","first-page":"4199","DOI":"10.1007\/s12065-024-00979-8","volume":"17","author":"MN Habibpour Roudsari","year":"2024","unstructured":"Habibpour Roudsari MN (2024) Improved task scheduling in heterogeneous distributed systems using intelligent greedy harris hawk optimization algorithm. Evol Intell 17:4199\u20134226. https:\/\/doi.org\/10.1007\/s12065-024-00979-8","journal-title":"Evol Intell"},{"key":"7293_CR25","doi-asserted-by":"publisher","first-page":"74","DOI":"10.2197\/ipsjtsldm.12.74","volume":"12","author":"Y Liu","year":"2019","unstructured":"Liu Y, Meng L, Tomiyama H (2019) A genetic algorithm for scheduling of data-parallel tasks on multicore architectures. IPSJ Trans Syst LSI Des Methodol 12:74\u201377. https:\/\/doi.org\/10.2197\/ipsjtsldm.12.74","journal-title":"IPSJ Trans Syst LSI Des Methodol"},{"issue":"4","key":"7293_CR26","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1515\/jisys-2017-0268","volume":"28","author":"F Alkhateeb","year":"2017","unstructured":"Alkhateeb F, Abed-alguni BH (2017) A hybrid cuckoo search and simulated annealing algorithm. J Intell Syst 28(4):683\u2013698. https:\/\/doi.org\/10.1515\/jisys-2017-0268","journal-title":"J Intell Syst"},{"issue":"5","key":"7293_CR27","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1111\/itor.12195","volume":"24","author":"MA Cruz-ch","year":"2017","unstructured":"Cruz-ch MA, Mart G (2017) Accelerated simulated annealing algorithm applied to the flexible job shop scheduling problem. Int Trans Oper Res 24(5):1119\u20131137. https:\/\/doi.org\/10.1111\/itor.12195","journal-title":"Int Trans Oper Res"},{"issue":"3","key":"7293_CR28","doi-asserted-by":"publisher","first-page":"100280","DOI":"10.1016\/j.array.2023.100280","volume":"17","author":"J Elcock","year":"2023","unstructured":"Elcock J, Edward N (2023) An efficient ACO-based algorithm for task scheduling in heterogeneous multiprocessing environments. Array 17(3):100280. https:\/\/doi.org\/10.1016\/j.array.2023.100280","journal-title":"Array"},{"key":"7293_CR29","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/7319036","author":"H Piroozfard","year":"2016","unstructured":"Piroozfard H, Wong KY, Hassan A (2016) A hybrid genetic algorithm with a knowledge-based operator for solving the job shop scheduling problems. J Optim. https:\/\/doi.org\/10.1155\/2016\/7319036","journal-title":"J Optim"},{"key":"7293_CR30","doi-asserted-by":"publisher","unstructured":"Mohammadjafari A, Khajouie P (2024) Optimizing task scheduling in heterogeneous computing environments: a comparative analysis of cpu, gpu, and asic platforms using e2c simulator. https:\/\/doi.org\/10.48550\/arXiv.2405.08187","DOI":"10.48550\/arXiv.2405.08187"},{"issue":"1","key":"7293_CR31","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1162\/EVCO_a_00162","volume":"25","author":"M Amirghasemi","year":"2017","unstructured":"Amirghasemi M, Zamani R (2017) An efficient evolutionary hybrid for solving the permutation flow shop scheduling problem. Evol Comput 25(1):87\u2013111. https:\/\/doi.org\/10.1162\/EVCO_a_00162","journal-title":"Evol Comput"},{"key":"7293_CR32","doi-asserted-by":"publisher","first-page":"6529","DOI":"10.1007\/s11227-017-2043-5","volume":"74","author":"L Chen","year":"2018","unstructured":"Chen L, Li X (2018) Cloud workflow scheduling with hybrid resource provisioning. J Supercomput 74:6529\u20136553. https:\/\/doi.org\/10.1007\/s11227-017-2043-5","journal-title":"J Supercomput"},{"key":"7293_CR33","doi-asserted-by":"publisher","first-page":"104931","DOI":"10.1016\/j.cor.2020.104931","volume":"119","author":"CR Vela","year":"2020","unstructured":"Vela CR, Afsar S, Jose J, Gonz\u00e1lez-rodr\u00edguez I, Puente J (2020) Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling. Comput Oper Res 119:104931. https:\/\/doi.org\/10.1016\/j.cor.2020.104931","journal-title":"Comput Oper Res"},{"issue":"1","key":"7293_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/IJSSCI.300359","volume":"14","author":"VK Chawra","year":"2022","unstructured":"Chawra VK, Gupta GP (2022) Optimization of the wake-up scheduling using a hybrid of memetic and tabu search algorithms for 3D-wireless sensor networks. Int J Softw Sci Comput Intell IJSSCI 14(1):1\u201318. https:\/\/doi.org\/10.4018\/IJSSCI.300359","journal-title":"Int J Softw Sci Comput Intell IJSSCI"},{"issue":"11","key":"7293_CR35","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.1016\/S0305-0548(03)00145-X","volume":"31","author":"J Grabowski","year":"2004","unstructured":"Grabowski J, Wodecki M (2004) A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput Oper Res 31(11):1891\u20131909. https:\/\/doi.org\/10.1016\/S0305-0548(03)00145-X","journal-title":"Comput Oper Res"},{"key":"7293_CR36","doi-asserted-by":"publisher","first-page":"11561","DOI":"10.1007\/s10586-017-1420-4","volume":"22","author":"G Zhang","year":"2018","unstructured":"Zhang G, Zhang L, Song X, Wang Y, Zhou C (2018) A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem. Clust Comput 22:11561\u201311572. https:\/\/doi.org\/10.1007\/s10586-017-1420-4","journal-title":"Clust Comput"},{"issue":"2","key":"7293_CR37","doi-asserted-by":"publisher","first-page":"16","DOI":"10.31181\/dmame060123042023m","volume":"6","author":"T Mzili","year":"2023","unstructured":"Mzili T, Mzili I, Riffi ME (2023) Optimizing production scheduling with the rat swarm search algorithm: a novel approach to the flow shop problem for enhanced decision making. Decis Mak Appl Manag Eng 6(2):16\u201342. https:\/\/doi.org\/10.31181\/dmame060123042023m","journal-title":"Decis Mak Appl Manag Eng"},{"issue":"1","key":"7293_CR38","doi-asserted-by":"publisher","first-page":"30","DOI":"10.21608\/IJCI.2023.213534.1114","volume":"11","author":"A Saad","year":"2024","unstructured":"Saad A, Abdelraouf O, Kafafy A (2024) Comparative study of intelligent scheduling algorithms for heterogeneous systems. Int J Comput Inf IJCI 11(1):30\u201343. https:\/\/doi.org\/10.21608\/IJCI.2023.213534.1114","journal-title":"Int J Comput Inf IJCI"},{"issue":"3","key":"7293_CR39","doi-asserted-by":"publisher","first-page":"10038","DOI":"10.1016\/j.eij.2023.05.008","volume":"24","author":"H Wang","year":"2023","unstructured":"Wang H, Li R, Gong W (2023) Minimizing tardiness and makespan for distributed heterogeneous unrelated parallel machine scheduling by knowledge and Pareto-based memetic algorithm. Egypt Informat J 24(3):10038. https:\/\/doi.org\/10.1016\/j.eij.2023.05.008","journal-title":"Egypt Informat J"},{"key":"7293_CR40","doi-asserted-by":"publisher","unstructured":"Prasanna Kumar KR, Siddesh GM, Ananda Babu J (2024) An empirical analysis of load balancing issues in fog computing environment. In: Second International Conference on Data Science and Information System (ICDSIS). https:\/\/doi.org\/10.1109\/ICDSIS61070.2024.10594459","DOI":"10.1109\/ICDSIS61070.2024.10594459"},{"key":"7293_CR41","doi-asserted-by":"publisher","unstructured":"Adamuthe AC, Bichkar RS (2012) Tabu search for solving personnel scheduling problem. In: 2012 International Conference on Communication, Information & Computing Technology (ICCICT). IEEE, pp 1\u20136. https:\/\/doi.org\/10.1109\/ICCICT.2012.6398097","DOI":"10.1109\/ICCICT.2012.6398097"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07293-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07293-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07293-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T14:18:21Z","timestamp":1746713901000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07293-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,8]]},"references-count":41,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2025,5]]}},"alternative-id":["7293"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07293-9","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,8]]},"assertion":[{"value":"5 April 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2025","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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"842"}}