{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:16:24Z","timestamp":1766578584805,"version":"3.37.3"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T00:00:00Z","timestamp":1543363200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00500-018-3663-2","type":"journal-article","created":{"date-parts":[[2018,11,27]],"date-time":"2018-11-27T21:13:06Z","timestamp":1543353186000},"page":"11107-11122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A data mining approach for population-based methods to solve the JSSP"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9813-1233","authenticated-orcid":false,"given":"Mohammad Mahdi","family":"Nasiri","sequence":"first","affiliation":[]},{"given":"Sadegh","family":"Salesi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4084-1555","authenticated-orcid":false,"given":"Ali","family":"Rahbari","sequence":"additional","affiliation":[]},{"given":"Navid","family":"Salmanzadeh Meydani","sequence":"additional","affiliation":[]},{"given":"Mojtaba","family":"Abdollai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,28]]},"reference":[{"key":"3663_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference very large data bases, VLDB, pp 487\u2013499"},{"key":"3663_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"2","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. ACM Sigmod Rec 2:207\u2013216","journal-title":"ACM Sigmod Rec"},{"key":"3663_CR3","first-page":"149","volume":"3","author":"D Applegate","year":"1991","unstructured":"Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem ORSA. J Comput 3:149\u2013156","journal-title":"J Comput"},{"key":"3663_CR4","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cie.2016.12.038","volume":"105","author":"JEC Arroyo","year":"2017","unstructured":"Arroyo JEC, Leung JYT (2017) An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times. Comput Ind Eng 105:84\u2013100. \n                    https:\/\/doi.org\/10.1016\/j.cie.2016.12.038","journal-title":"Comput Ind Eng"},{"key":"3663_CR5","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.cie.2015.04.006","volume":"85","author":"L Asadzadeh","year":"2015","unstructured":"Asadzadeh L (2015) A local search genetic algorithm for the job shop scheduling problem with intelligent agents. Comput Ind Eng 85:376\u2013383","journal-title":"Comput Ind Eng"},{"key":"3663_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.1100.0388","volume":"23","author":"JC Beck","year":"2011","unstructured":"Beck JC, Feng T, Watson J-P (2011) Combining constraint programming and local search for job-shop scheduling. INFORMS J Comput 23:1\u201314","journal-title":"INFORMS J Comput"},{"key":"3663_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0167-9236(95)00029-1","volume":"17","author":"R Belz","year":"1996","unstructured":"Belz R, Mertens P (1996) Combining knowledge-based systems and simulation to solve rescheduling problems. Decis Support Syst 17:141\u2013157","journal-title":"Decis Support Syst"},{"key":"3663_CR8","unstructured":"Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the 6th international symposium on micro machine and human science, New York, pp 39\u201343"},{"key":"3663_CR9","first-page":"225","volume":"3","author":"H Fisher","year":"1963","unstructured":"Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. Ind Sched 3:225\u2013251","journal-title":"Ind Sched"},{"key":"3663_CR10","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10845-014-0869-8","volume":"27","author":"KZ Gao","year":"2016","unstructured":"Gao KZ, Suganthan PN, Pan QK, Chua TJ, Cai TX, Chong CS (2016) Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. J Intell Manuf 27:363\u2013374. \n                    https:\/\/doi.org\/10.1007\/s10845-014-0869-8","journal-title":"J Intell Manuf"},{"key":"3663_CR11","volume-title":"Computers and intractability","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability, vol 174. Freeman, San Francisco"},{"key":"3663_CR12","unstructured":"Gon\u00e7alves JF, Resende MG (2011) A biased random-key genetic algorithm for job-shop scheduling. AT&T Labs Research Technical Report, Florham Park, p 7932"},{"key":"3663_CR13","unstructured":"Han J, Fu Y (1994) Dynamic generation and refinement of concept hierarchies for knowledge discovery in databases. In: KDD workshop, pp 157\u2013168"},{"key":"3663_CR14","unstructured":"Han J, Fu Y (1995) Discovery of multiple-level association rules from large databases. In: VLDB, pp 420\u2013431"},{"key":"3663_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/69.204089","volume":"5","author":"J Han","year":"1993","unstructured":"Han J, Cai Y, Cercone N (1993a) Data-driven discovery of quantitative rules in relational databases. IEEE Trans Knowl Data Eng 5:29\u201340","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3663_CR16","first-page":"1","volume":"14","author":"J Han","year":"1993","unstructured":"Han J, Cai Y, Cercone N, Huang Y (1993b) Discovery of data evolution regularities in large databases. J Comput Softw Eng 14:1\u201329","journal-title":"J Comput Softw Eng"},{"key":"3663_CR17","volume-title":"Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press, Ann Arbor"},{"key":"3663_CR18","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1016\/j.ejor.2005.07.026","volume":"173","author":"A-L Huyet","year":"2006","unstructured":"Huyet A-L (2006) Optimization and analysis aid via data-mining for simulated production systems. Eur J Oper Res 173:827\u2013838","journal-title":"Eur J Oper Res"},{"key":"3663_CR19","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1016\/j.asoc.2016.07.004","volume":"56","author":"J Jos\u00e9 Palacios","year":"2017","unstructured":"Jos\u00e9 Palacios J, Gonz\u00e1lez-Rodr\u00edguez I, Vela CR, Puente J (2017) Robust multiobjective optimisation for fuzzy job shop problems. Appl Soft Comput 56:604\u2013616. \n                    https:\/\/doi.org\/10.1016\/j.asoc.2016.07.004","journal-title":"Appl Soft Comput"},{"key":"3663_CR20","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.knosys.2012.04.001","volume":"36","author":"H Karimi","year":"2012","unstructured":"Karimi H, Rahmati SHA, Zandieh M (2012) An efficient knowledge-based algorithm for the flexible job shop scheduling problem. Knowl-Based Syst 36:236\u2013244","journal-title":"Knowl-Based Syst"},{"key":"3663_CR21","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0360-8352(00)00050-4","volume":"38","author":"D Koonce","year":"2000","unstructured":"Koonce D, Tsai S-C (2000) Using data mining to find patterns in genetic algorithm solutions to a job shop schedule. Comput Ind Eng 38:361\u2013374","journal-title":"Comput Ind Eng"},{"key":"3663_CR22","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/j.rcim.2009.04.015","volume":"25","author":"S Kumar","year":"2009","unstructured":"Kumar S, Rao C (2009) Application of ant colony, genetic algorithm and data mining-based techniques for scheduling. Robot Comput Integr Manuf 25:901\u2013908","journal-title":"Robot Comput Integr Manuf"},{"key":"3663_CR23","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.cor.2015.10.005","volume":"67","author":"M Kurdi","year":"2016","unstructured":"Kurdi M (2016) An effective new island model genetic algorithm for job shop scheduling problem. Comput Oper Res 67:132\u2013142","journal-title":"Comput Oper Res"},{"key":"3663_CR24","volume-title":"Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement)","author":"S Lawrence","year":"1984","unstructured":"Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh"},{"key":"3663_CR25","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10951-005-4781-0","volume":"8","author":"X Li","year":"2005","unstructured":"Li X, Olafsson S (2005) Discovering dispatching rules using data mining. J Sched 8:515\u2013527","journal-title":"J Sched"},{"key":"3663_CR26","doi-asserted-by":"publisher","first-page":"1857","DOI":"10.1016\/j.cor.2004.11.022","volume":"33","author":"D-C Li","year":"2006","unstructured":"Li D-C, Wu C-S, Tsai T-I, Chang FM (2006) Using mega-fuzzification and data trend estimation in small data set learning for early FMS scheduling knowledge. Comput Oper Res 33:1857\u20131869","journal-title":"Comput Oper Res"},{"key":"3663_CR27","first-page":"46","volume":"22","author":"Y-H Liu","year":"2005","unstructured":"Liu Y-H, Huang H-P, Lin Y-S (2005) Attribute selection for the scheduling of flexible manufacturing systems based on fuzzy Set-theoretic approach and genetic algorithm. J Chin Inst Ind Eng 22:46\u201355","journal-title":"J Chin Inst Ind Eng"},{"key":"3663_CR28","doi-asserted-by":"crossref","unstructured":"Meng Q, Zhang L, Fan Y (2016) A hybrid particle swarm optimization algorithm for solving job shop scheduling problems. In: Asian simulation conference. Springer, pp 71\u201378","DOI":"10.1007\/978-981-10-2666-9_8"},{"key":"3663_CR29","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.eswa.2016.06.014","volume":"62","author":"S Mirshekarian","year":"2016","unstructured":"Mirshekarian S, \u0160ormaz DN (2016) Correlation of job-shop scheduling problem features with scheduling efficiency. Expert Syst Appl 62:131\u2013147","journal-title":"Expert Syst Appl"},{"key":"3663_CR30","first-page":"1","volume":"58","author":"S Mishra","year":"2017","unstructured":"Mishra S, Bose P, Rao C (2017) An invasive weed optimization approach for job shop scheduling problems. Int J Adv Manuf Technol 58:1\u20139","journal-title":"Int J Adv Manuf Technol"},{"key":"3663_CR31","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1007\/s00170-012-4227-8","volume":"65","author":"MM Nasiri","year":"2013","unstructured":"Nasiri MM (2013) A pseudo particle swarm optimization for the RCPSP. Int J Adv Manuf Technol 65:909\u2013918","journal-title":"Int J Adv Manuf Technol"},{"key":"3663_CR32","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1016\/j.cie.2011.12.018","volume":"62","author":"MM Nasiri","year":"2012","unstructured":"Nasiri MM, Kianfar F (2012a) A GES\/TS algorithm for the job shop scheduling. Comput Ind Eng 62:946\u2013952","journal-title":"Comput Ind Eng"},{"key":"3663_CR33","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1007\/s00170-011-3441-0","volume":"58","author":"MM Nasiri","year":"2012","unstructured":"Nasiri MM, Kianfar F (2012b) A guided tabu search\/path relinking algorithm for the job shop problem. Int J Adv Manuf Technol 58:1105\u20131113","journal-title":"Int J Adv Manuf Technol"},{"key":"3663_CR34","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1080\/0951192X.2017.1307452","volume":"30","author":"MM Nasiri","year":"2017","unstructured":"Nasiri MM, Yazdanparast R, Jolai F (2017) A simulation optimisation approach for real-time scheduling in an open shop environment using a composite dispatching rule. Int J Comput Integr Manuf 30:1239\u20131252","journal-title":"Int J Comput Integr Manuf"},{"key":"3663_CR35","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manag Sci 42:797\u2013813","journal-title":"Manag Sci"},{"key":"3663_CR36","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.asoc.2017.11.020","volume":"63","author":"J Park","year":"2018","unstructured":"Park J, Mei Y, Nguyen S, Chen G, Zhang M (2018) An investigation of ensemble combination schemes for genetic programming based hyper-heuristic approaches to dynamic job shop scheduling. Appl Soft Comput 63:72\u201386. \n                    https:\/\/doi.org\/10.1016\/j.asoc.2017.11.020","journal-title":"Appl Soft Comput"},{"key":"3663_CR37","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.cor.2014.08.006","volume":"53","author":"B Peng","year":"2015","unstructured":"Peng B, L\u00fc Z, Cheng T (2015) A tabu search\/path relinking algorithm to solve the job shop scheduling problem. Comput Oper Res 53:154\u2013164","journal-title":"Comput Oper Res"},{"key":"3663_CR38","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1016\/j.engappai.2012.04.001","volume":"25","author":"A Shahzad","year":"2012","unstructured":"Shahzad A, Mebarki N (2012) Data mining based job dispatching using hybrid simulation-optimization approach for shop scheduling problem. Eng Appl Artif Intell 25:1173\u20131181","journal-title":"Eng Appl Artif Intell"},{"key":"3663_CR39","doi-asserted-by":"publisher","first-page":"6531","DOI":"10.1007\/s00500-016-2245-4","volume":"21","author":"X-N Shen","year":"2017","unstructured":"Shen X-N, Han Y, Fu J-Z (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":"3663_CR40","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0377-2217(93)E0294-8","volume":"80","author":"A Sprecher","year":"1995","unstructured":"Sprecher A, Kolisch R, Drexl A (1995) Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. Eur J Oper Res 80:94\u2013102","journal-title":"Eur J Oper Res"},{"key":"3663_CR41","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"RH Storer","year":"1992","unstructured":"Storer RH, Wu SD, Vaccari R (1992) New search spaces for sequencing problems with application to job shop scheduling. Manag Sci 38:1495\u20131509","journal-title":"Manag Sci"},{"key":"3663_CR42","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1007\/s00500-015-1852-9","volume":"21","author":"S Sundar","year":"2017","unstructured":"Sundar S, Suganthan PN, Jin CT, Xiang CT, Soon CC (2017) A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint. Soft Comput 21:1193\u20131202","journal-title":"Soft Comput"},{"key":"3663_CR43","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.asoc.2017.01.011","volume":"54","author":"N Ve\u010dek","year":"2017","unstructured":"Ve\u010dek N, \u010crepin\u0161ek M, Mernik M (2017) On the influence of the number of algorithms, problems, and independent runs in the comparison of evolutionary algorithms. Appl Soft Comput 54:23\u201345. \n                    https:\/\/doi.org\/10.1016\/j.asoc.2017.01.011","journal-title":"Appl Soft Comput"},{"key":"3663_CR44","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.cie.2014.04.006","volume":"73","author":"X Wang","year":"2014","unstructured":"Wang X, Duan H (2014) A hybrid biogeography-based optimization algorithm for job shop scheduling problem. Comput Ind Eng 73:96\u2013114","journal-title":"Comput Ind Eng"},{"key":"3663_CR45","doi-asserted-by":"publisher","first-page":"180","DOI":"10.17706\/IJCCE.2015.4.3.180-186","volume":"4","author":"Y Wang","year":"2015","unstructured":"Wang Y, Ji D (2015) Data-and rule-based integrated mechanism for job shop scheduling. Int J Comput Commu Eng 4:180","journal-title":"Int J Comput Commu Eng"},{"key":"3663_CR46","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.ifacol.2015.06.181","volume":"48","author":"C Wang","year":"2015","unstructured":"Wang C, Rong G, Weng W, Feng Y (2015) Mining scheduling knowledge for job shop scheduling problem. IFAC-PapersOnLine 48:800\u2013805","journal-title":"IFAC-PapersOnLine"},{"key":"3663_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40436-015-0131-4","volume":"4","author":"L Wang","year":"2016","unstructured":"Wang L, Cai J-C, Li M (2016) An adaptive multi-population genetic algorithm for job-shop scheduling problem. Adv Manuf 4:1\u20138","journal-title":"Adv Manuf"},{"key":"3663_CR48","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.asoc.2017.10.020","volume":"62","author":"B Wang","year":"2018","unstructured":"Wang B, Wang X, Lan F, Pan Q (2018) A hybrid local-search algorithm for robust job-shop scheduling under scenarios. Appl Soft Comput 62:259\u2013271","journal-title":"Appl Soft Comput"},{"key":"3663_CR49","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10845-008-0073-9","volume":"19","author":"GR Weckman","year":"2008","unstructured":"Weckman GR, Ganduri CV, Koonce DA (2008) A neural network job-shop scheduler. J Intell Manuf 19:191\u2013201","journal-title":"J Intell Manuf"},{"key":"3663_CR50","doi-asserted-by":"publisher","first-page":"7609","DOI":"10.1016\/j.eswa.2010.12.101","volume":"38","author":"HK Zare","year":"2011","unstructured":"Zare HK, Fakhrzad MB (2011) Solving flexible flow-shop problem with a hybrid genetic algorithm and data mining: a fuzzy approach. Expert Syst Appl 38:7609\u20137615","journal-title":"Expert Syst Appl"},{"key":"3663_CR51","doi-asserted-by":"publisher","first-page":"3229","DOI":"10.1016\/j.cor.2005.12.002","volume":"34","author":"C Zhang","year":"2007","unstructured":"Zhang C, Li P, Guan Z, Rao Y (2007) A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput Oper Res 34:3229\u20133242","journal-title":"Comput Oper Res"},{"key":"3663_CR52","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.cor.2006.02.024","volume":"35","author":"CY Zhang","year":"2008","unstructured":"Zhang CY, Li P, Rao Y, Guan Z (2008) A very fast TS\/SA algorithm for the job shop scheduling problem. Comput Oper Res 35:282\u2013294","journal-title":"Comput Oper Res"},{"key":"3663_CR53","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.ijpe.2012.03.035","volume":"141","author":"R Zhang","year":"2013","unstructured":"Zhang R, Song S, Wu C (2013) A hybrid artificial bee colony algorithm for the job shop scheduling problem. Int J Prod Econ 141:167\u2013178","journal-title":"Int J Prod Econ"},{"key":"3663_CR54","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.cor.2013.11.019","volume":"45","author":"F Zhao","year":"2014","unstructured":"Zhao F, Tang J, Wang J (2014) An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem. Comput Oper Res 45:38\u201350","journal-title":"Comput Oper Res"},{"issue":"8","key":"3663_CR100","doi-asserted-by":"publisher","first-page":"3953","DOI":"10.1016\/j.eswa.2015.01.007","volume":"42","author":"F Zhao","year":"2015","unstructured":"Zhao F, Zhang J, Zhang C, Wang J (2015) An improved shuffled complex evolution algorithm with sequence mapping mechanism for job shop scheduling problems. Expert Syst Appl 42(8):3953\u20133966","journal-title":"Expert Syst Appl"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3663-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3663-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3663-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T19:16:02Z","timestamp":1574882162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3663-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,28]]},"references-count":55,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["3663"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3663-2","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2018,11,28]]},"assertion":[{"value":"28 November 2018","order":1,"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":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}