{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:24:37Z","timestamp":1786980277994,"version":"3.56.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T00:00:00Z","timestamp":1643414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T00:00:00Z","timestamp":1643414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62073127"],"award-info":[{"award-number":["62073127"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key R & D Program of China","doi-asserted-by":"crossref","award":["2018YFB1308200"],"award-info":[{"award-number":["2018YFB1308200"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s00500-021-06697-y","type":"journal-article","created":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T19:02:43Z","timestamp":1643396563000},"page":"8911-8928","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Multi-objective casting production scheduling problem by a neighborhood structure enhanced discrete NSGA-II: an application from real-world workshop"],"prefix":"10.1007","volume":"26","author":[{"given":"Weihua","family":"Tan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7280-7207","authenticated-orcid":false,"given":"Xiaofang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuhui","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lianghong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,1,29]]},"reference":[{"issue":"4","key":"6697_CR1","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1016\/j.cor.2010.09.004","volume":"38","author":"MS Akturk","year":"2011","unstructured":"Akturk MS, Ilhan T (2011) Single cnc machine scheduling with controllable processing times to minimize total weighted tardiness. Comput Oper Res 38(4):771\u2013781","journal-title":"Comput Oper Res"},{"key":"6697_CR2","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/s00170-014-6177-9","volume":"75","author":"H Asefi","year":"2014","unstructured":"Asefi H, Jolai F, Rabiee M, Araghi MET (2014) A hybrid nsga-ii and vns for solving a bi-objective no-wait flexible flowshop scheduling problem. Int J Adv Manuf Technol 75:1017\u20131033","journal-title":"Int J Adv Manuf Technol"},{"issue":"21","key":"6697_CR3","doi-asserted-by":"publisher","first-page":"6087","DOI":"10.1080\/00207540701262913","volume":"46","author":"MO Atan","year":"2008","unstructured":"Atan MO, Akturk MS (2008) Single cnc machine scheduling with controllable processing times and multiple due dates. Int J Prod Res 46(21):6087\u20136111","journal-title":"Int J Prod Res"},{"issue":"3","key":"6697_CR4","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1111\/itor.12199","volume":"23","author":"IA Chaudhry","year":"2016","unstructured":"Chaudhry IA, Khan AA (2016) A research survey: review of flexible job shop scheduling techniques. Int Trans Oper Res 23(3):551\u2013591","journal-title":"Int Trans Oper Res"},{"key":"6697_CR5","doi-asserted-by":"crossref","unstructured":"Che, A., Lv, K., Levner, E., Kats, V.: Energy consumption minimization for single machine scheduling with bounded maximum tardiness. In: 2015 IEEE 12th international conference on networking, sensing and control, pp. 146\u2013150 (2015)","DOI":"10.1109\/ICNSC.2015.7116025"},{"key":"6697_CR6","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.jmsy.2019.12.004","volume":"54","author":"X Chen","year":"2020","unstructured":"Chen X, An Y, Zhang Z, Li Y (2020) An approximate nondominated sorting genetic algorithm to integrate optimization of production scheduling and accurate maintenance based on reliability intervals. J Manuf Syst 54:227\u2013241","journal-title":"J Manuf Syst"},{"issue":"4","key":"6697_CR7","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/0360-8352(96)00047-2","volume":"30","author":"R Cheng","year":"1996","unstructured":"Cheng R, Gen M, Tsujimura Y (1996) A tutorial survey of job-shop scheduling problems using genetic algorithms-i: representation. Comput Ind Eng 30(4):983\u2013997","journal-title":"Comput Ind Eng"},{"key":"6697_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.rcim.2019.04.006","volume":"59","author":"M Dai","year":"2019","unstructured":"Dai M, Tang D, Giret A, Salido MA (2019) Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints. Robot Comput-Integrat Manuf 59:143\u2013157","journal-title":"Robot Comput-Integrat Manuf"},{"issue":"4","key":"6697_CR9","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: Solving problems with box constraints. IEEE Trans Evol Comput 18(4):577\u2013601","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"6697_CR10","doi-asserted-by":"publisher","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":"6697_CR11","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","volume":"18","author":"P Fattahi","year":"2007","unstructured":"Fattahi P, Mehrabad MS, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18(3):331\u2013342","journal-title":"J Intell Manuf"},{"issue":"5","key":"6697_CR12","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/s10845-013-0804-4","volume":"25","author":"M Gen","year":"2014","unstructured":"Gen M, Lin L (2014) Multiobjective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey. J Intell Manuf 25(5):849\u2013866","journal-title":"J Intell Manuf"},{"key":"6697_CR13","doi-asserted-by":"publisher","first-page":"6147","DOI":"10.1080\/00207543.2018.1478150","volume":"56","author":"Z Hajej","year":"2018","unstructured":"Hajej Z, Rezg N, Gharbi A (2018) Quality issue in forecasting problem of production and maintenance policy for production unit. Int J Prod Res 56:6147\u20136163","journal-title":"Int J Prod Res"},{"key":"6697_CR14","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.cie.2017.10.028","volume":"115","author":"S Jiang","year":"2018","unstructured":"Jiang S, Zheng Z, Liu M (2018) A preference-inspired multi-objective soft scheduling algorithm for the practical steelmaking-continuous casting production. Comput Ind Eng 115:582\u2013594","journal-title":"Comput Ind Eng"},{"issue":"3","key":"6697_CR15","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1016\/j.ejor.2004.07.012","volume":"167","author":"RK Kayan","year":"2005","unstructured":"Kayan RK, Akturk MS (2005) A new bounding mechanism for the cnc machine scheduling problems with controllable processing times. Eur J Oper Res 167(3):624\u2013643","journal-title":"Eur J Oper Res"},{"key":"6697_CR16","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1057\/jors.1994.217","volume":"45","author":"M Khouja","year":"1994","unstructured":"Khouja M, Mehrez A (1994) Economic production lot size model with variable production rate and imperfect quality. J Oper Res Soc 45:1405\u20131417","journal-title":"J Oper Res Soc"},{"issue":"3","key":"6697_CR17","first-page":"1097","volume":"49","author":"D Lei","year":"2019","unstructured":"Lei D, Li M, Wang L (2019) A two-phase meta-heuristic for multiobjective flexible job shop scheduling problem with total energy consumption threshold. IEEE Trans Syst Man Cybern 49(3):1097\u20131109","journal-title":"IEEE Trans Syst Man Cybern"},{"issue":"4","key":"6697_CR18","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.cie.2010.07.014","volume":"59","author":"J Li","year":"2010","unstructured":"Li J, Pan Q, Liang Y (2010) An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 59(4):647\u2013662","journal-title":"Comput Ind Eng"},{"issue":"5","key":"6697_CR19","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00170-010-2743-y","volume":"52","author":"J Li","year":"2011","unstructured":"Li J, Pan Q, Suganthan PN, Chua TJ (2011) A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem. Int J Adv Manuf Technol 52(5):683\u2013697","journal-title":"Int J Adv Manuf Technol"},{"issue":"11","key":"6697_CR20","doi-asserted-by":"publisher","first-page":"3073","DOI":"10.1080\/00207543.2016.1241446","volume":"55","author":"G Liu","year":"2017","unstructured":"Liu G, Yang H, Cheng M (2017) A three-stage decomposition approach for energy-aware scheduling with processing-time-dependent product quality. Int J Prod Res 55(11):3073\u20133091","journal-title":"Int J Prod Res"},{"key":"6697_CR21","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.cie.2016.12.020","volume":"104","author":"C Lu","year":"2017","unstructured":"Lu C, Li X, Gao L, Liao W, Yi J (2017) An effective multi-objective discrete virus optimization algorithm for flexible job-shop scheduling problem with controllable processing times. Comput Ind Eng 104:156\u2013174","journal-title":"Comput Ind Eng"},{"key":"6697_CR22","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","journal-title":"J Clean Prod"},{"issue":"3","key":"6697_CR23","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1016\/j.ejor.2015.08.064","volume":"248","author":"SA Mansouri","year":"2016","unstructured":"Mansouri SA, Aktas E, Besikci U (2016) Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption. Eur J Oper Res 248(3):772\u2013788","journal-title":"Eur J Oper Res"},{"key":"6697_CR24","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ijpe.2019.01.017","volume":"211","author":"B Marchi","year":"2019","unstructured":"Marchi B, Zanoni S, Zavanella L, Jaber MY (2019) Supply chain models with greenhouse gases emissions, energy usage, imperfect process under different coordination decisions. Int J Prod Econ 211:145\u2013153","journal-title":"Int J Prod Econ"},{"key":"6697_CR25","doi-asserted-by":"publisher","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":"1","key":"6697_CR26","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ijpe.2010.08.004","volume":"129","author":"G Moslehi","year":"2011","unstructured":"Moslehi G, Mahnam M (2011) A pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search. Int J Prod Econ 129(1):14\u201322","journal-title":"Int J Prod Econ"},{"issue":"2","key":"6697_CR27","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.ejor.2017.06.062","volume":"264","author":"S Ouaret","year":"2018","unstructured":"Ouaret S, Kenne J, Gharbi A (2018) Production and replacement policies for a deteriorating manufacturing system under random demand and quality. Eur J Oper Res 264(2):623\u2013636","journal-title":"Eur J Oper Res"},{"issue":"9","key":"6697_CR28","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1007\/s00170-014-5756-0","volume":"72","author":"T Peng","year":"2014","unstructured":"Peng T, Xu X (2014) Energy-efficient machining systems: a critical review. Int J Adv Manuf Technol 72(9):1389\u20131406","journal-title":"Int J Adv Manuf Technol"},{"key":"6697_CR29","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.resconrec.2016.12.001","volume":"128","author":"H Piroozfard","year":"2018","unstructured":"Piroozfard H, Wong KY, Wong WP (2018) Minimizing total carbon footprint and total late work criterion in flexible job shop scheduling by using an improved multi-objective genetic algorithm. Resour Conserv Recycl 128:267\u2013283","journal-title":"Resour Conserv Recycl"},{"key":"6697_CR30","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.cie.2018.12.061","volume":"128","author":"H Qin","year":"2019","unstructured":"Qin H, Fan P, Tang H, Huang P, Fang B, Pan S (2019) An effective hybrid discrete grey wolf optimizer for the casting production scheduling problem with multi-objective and multi-constraint. Comput Ind Eng 128:458\u2013476","journal-title":"Comput Ind Eng"},{"key":"6697_CR31","doi-asserted-by":"publisher","first-page":"3633","DOI":"10.1007\/s00170-018-1751-1","volume":"96","author":"M Rezaeimalek","year":"2018","unstructured":"Rezaeimalek M, Tavakkolimoghaddam R, Siadat A, Dantan J (2018) A novel model for the integrated planning of part quality inspection and preventive maintenance in a linear-deteriorating serial multi-stage manufacturing system. Int J Adv Manuf Technol 96:3633\u20133650","journal-title":"Int J Adv Manuf Technol"},{"key":"6697_CR32","doi-asserted-by":"publisher","first-page":"2885","DOI":"10.1007\/s00170-012-4701-3","volume":"67","author":"X Shao","year":"2013","unstructured":"Shao X, Liu W, Liu Q, Zhang C (2013) Hybrid discrete particle swarm optimization for multi-objective flexible job-shop scheduling problem. Int J Adv Manuf Technol 67:2885\u20132901","journal-title":"Int J Adv Manuf Technol"},{"key":"6697_CR33","doi-asserted-by":"publisher","first-page":"6531","DOI":"10.1007\/s00500-016-2245-4","volume":"21","author":"X Shen","year":"2017","unstructured":"Shen X, Han Y, Fu J (2017) Robustness measures and robust scheduling for multi-objective stochastic flexible job shop scheduling problems. Soft Comput 21:6531\u20136554","journal-title":"Soft Comput"},{"key":"6697_CR34","doi-asserted-by":"publisher","first-page":"100632","DOI":"10.1016\/j.swevo.2019.100632","volume":"53","author":"C Soto","year":"2020","unstructured":"Soto C, Dorronsoro B, Fraire HH, Cruzreyes L, Gomezsantillan C, Rangel N (2020) Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm. Swarm Evol Comput 53:100632","journal-title":"Swarm Evol Comput"},{"issue":"5","key":"6697_CR35","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1007\/s00170-013-5122-7","volume":"69","author":"PP Tambe","year":"2013","unstructured":"Tambe PP, Mohite S, Kulkarni MS (2013) Optimisation of opportunistic maintenance of a multi-component system considering the effect of failures on quality and production schedule: A case study. Int J Adv Manuf Technol 69(5):1743\u20131756","journal-title":"Int J Adv Manuf Technol"},{"key":"6697_CR36","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.asoc.2019.02.011","volume":"78","author":"H Tang","year":"2019","unstructured":"Tang H, Chen R, Li Y, Peng Z, Guo S, Du Y (2019) Flexible job-shop scheduling with tolerated time interval and limited starting time interval based on hybrid discrete pso-sa: an application from a casting workshop. Appl Soft Comput 78:176\u2013194","journal-title":"Appl Soft Comput"},{"key":"6697_CR37","doi-asserted-by":"crossref","unstructured":"Turkyilmaz, A., \u015eenvar, O., Unal, I., Bulkan, S.: A research survey: heuristic approaches for solving multi objective flexible job shop problems. J Intell Manuf. pp. 1\u201335 (2020)","DOI":"10.1007\/s10845-020-01547-4"},{"issue":"2","key":"6697_CR38","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/j.cor.2012.09.001","volume":"40","author":"Z Uruk","year":"2013","unstructured":"Uruk Z, Gultekin H, Akturk MS (2013) Two-machine flowshop scheduling with flexible operations and controllable processing times. Comput Oper Res 40(2):639\u2013653","journal-title":"Comput Oper Res"},{"issue":"2","key":"6697_CR39","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1016\/j.ejor.2007.06.039","volume":"190","author":"G Vilcot","year":"2008","unstructured":"Vilcot G, Billaut J (2008) A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem. Eur J Oper Res 190(2):398\u2013411","journal-title":"Eur J Oper Res"},{"key":"6697_CR40","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1016\/j.cie.2019.06.048","volume":"135","author":"X Wu","year":"2019","unstructured":"Wu X, Shen X, Li C (2019) The flexible job-shop scheduling problem considering deterioration effect and energy consumption simultaneously. Comput Ind Eng 135:1004\u20131024","journal-title":"Comput Ind Eng"},{"key":"6697_CR41","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.cie.2005.01.018","volume":"48","author":"W Xia","year":"2005","unstructured":"Xia W, Wu Z (2005) An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 48:409\u2013425","journal-title":"Comput Ind Eng"},{"issue":"9","key":"6697_CR42","doi-asserted-by":"publisher","first-page":"3303","DOI":"10.1007\/s00170-018-2233-1","volume":"104","author":"W Xu","year":"2019","unstructured":"Xu W, Cao L (2019) Optimal maintenance control of machine tools for energy efficient manufacturing. Int J Adv Manuf Technol 104(9):3303\u20133311","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"6697_CR43","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1109\/TASE.2013.2274517","volume":"12","author":"Y Yuan","year":"2015","unstructured":"Yuan Y, Xu H (2015) Multiobjective flexible job shop scheduling using memetic algorithms. IEEE Trans Autom Sci Eng 12(1):336\u2013353","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"4","key":"6697_CR44","doi-asserted-by":"publisher","first-page":"3563","DOI":"10.1016\/j.eswa.2010.08.145","volume":"38","author":"G Zhang","year":"2011","unstructured":"Zhang G, Gao L, Shi Y (2011) An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst Appl 38(4):3563\u20133573","journal-title":"Expert Syst Appl"},{"issue":"4","key":"6697_CR45","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1016\/j.cie.2008.07.021","volume":"56","author":"G Zhang","year":"2009","unstructured":"Zhang G, Shao X, Li P, Gao L (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput Ind Eng 56(4):1309\u20131318","journal-title":"Comput Ind Eng"},{"issue":"5","key":"6697_CR46","doi-asserted-by":"publisher","first-page":"11561","DOI":"10.1007\/s10586-017-1420-4","volume":"22","author":"G Zhang","year":"2019","unstructured":"Zhang G, Zhang L, Song X, Wang Y, Zhou C (2019) A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem. Clust Comput 22(5):11561\u201311572","journal-title":"Clust Comput"},{"issue":"2","key":"6697_CR47","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8(2):173\u2013195","journal-title":"Evol Comput"},{"issue":"4","key":"6697_CR48","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06697-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-06697-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06697-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T07:00:00Z","timestamp":1676098800000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-06697-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,29]]},"references-count":48,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["6697"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-06697-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,29]]},"assertion":[{"value":"17 December 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"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 human participants or 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"}}]}}