{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:25:02Z","timestamp":1786980302647,"version":"build-2736575974"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T00:00:00Z","timestamp":1595808000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T00:00:00Z","timestamp":1595808000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s00521-020-05174-1","type":"journal-article","created":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T07:02:42Z","timestamp":1595833362000},"page":"3469-3486","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Artificial bee colony algorithm including some components of iterated greedy algorithm for permutation flow shop scheduling problems"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7088-2104","authenticated-orcid":false,"given":"O\u011fuzhan Ahmet","family":"Ar\u0131k","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,7,27]]},"reference":[{"key":"5174_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117\u2013129. https:\/\/doi.org\/10.1287\/moor.1.2.117","journal-title":"Math Oper Res"},{"key":"5174_CR2","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 Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11:91\u201395. https:\/\/doi.org\/10.1016\/0305-0483(83)90088-9","journal-title":"Omega"},{"key":"5174_CR3","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/j.ejor.2016.09.055","volume":"257","author":"V Fernandez-Viagas","year":"2017","unstructured":"Fernandez-Viagas V, Ruiz R, Framinan JM (2017) A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation. Eur J Oper Res 257:707\u2013721. https:\/\/doi.org\/10.1016\/j.ejor.2016.09.055","journal-title":"Eur J Oper Res"},{"key":"5174_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.omega.2013.07.004","volume":"45","author":"MM Yenisey","year":"2014","unstructured":"Yenisey MM, Yagmahan B (2014) Multi-objective permutation flow shop scheduling problem: literature review, classification and current trends. Omega (UK) 45:119\u2013135. https:\/\/doi.org\/10.1016\/j.omega.2013.07.004","journal-title":"Omega (UK)"},{"key":"5174_CR5","doi-asserted-by":"publisher","first-page":"2895","DOI":"10.1080\/0020754050056417","volume":"43","author":"S Reza Hejazi","year":"2005","unstructured":"Reza Hejazi S, Saghafian S (2005) Flowshop-scheduling problems with makespan criterion: a review. Int J Prod Res 43:2895\u20132929. https:\/\/doi.org\/10.1080\/0020754050056417","journal-title":"Int J Prod Res"},{"key":"5174_CR6","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1057\/palgrave.jors.2601784","volume":"55","author":"JM Framinan","year":"2004","unstructured":"Framinan JM, Gupta JND, Leisten R (2004) A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J Oper Res Soc 55:1243\u20131255. https:\/\/doi.org\/10.1057\/palgrave.jors.2601784","journal-title":"J Oper Res Soc"},{"key":"5174_CR7","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/S0377-2217(01)00278-8","volume":"141","author":"JM Framinan","year":"2002","unstructured":"Framinan JM, Leisten R, Ruiz-Usano R (2002) Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation. Eur J Oper Res 141:559\u2013569. https:\/\/doi.org\/10.1016\/S0377-2217(01)00278-8","journal-title":"Eur J Oper Res"},{"key":"5174_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist Q 1:61\u201368. https:\/\/doi.org\/10.1002\/nav.3800010110","journal-title":"Nav Res Logist Q"},{"key":"5174_CR9","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278\u2013285. https:\/\/doi.org\/10.1016\/0377-2217(93)90182-M","journal-title":"Eur J Oper Res"},{"key":"5174_CR10","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1016\/j.ejor.2014.07.033","volume":"240","author":"E Vallada","year":"2015","unstructured":"Vallada E, Ruiz R, Framinan JM (2015) New hard benchmark for flowshop scheduling problems minimising makespan. Eur J Oper Res 240:666\u2013677. https:\/\/doi.org\/10.1016\/j.ejor.2014.07.033","journal-title":"Eur J Oper Res"},{"key":"5174_CR11","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz R, St\u00fctzle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177:2033\u20132049. https:\/\/doi.org\/10.1016\/j.ejor.2005.12.009","journal-title":"Eur J Oper Res"},{"key":"5174_CR12","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.cie.2008.03.003","volume":"55","author":"Q-K Pan","year":"2008","unstructured":"Pan Q-K, Tasgetiren MF, Liang Y-C (2008) A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Comput Ind Eng 55:795\u2013816. https:\/\/doi.org\/10.1016\/j.cie.2008.03.003","journal-title":"Comput Ind Eng"},{"key":"5174_CR13","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.omega.2007.02.002","volume":"37","author":"SF Rad","year":"2009","unstructured":"Rad SF, Ruiz R, Boroojerdian N (2009) New high performing heuristics for minimizing makespan in permutation flowshops. Omega 37:331\u2013345. https:\/\/doi.org\/10.1016\/j.omega.2007.02.002","journal-title":"Omega"},{"key":"5174_CR14","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.cor.2016.12.021","volume":"81","author":"J Dubois-Lacoste","year":"2017","unstructured":"Dubois-Lacoste J, Pagnozzi F, St\u00fctzle T (2017) An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem. Comput Oper Res 81:160\u2013166. https:\/\/doi.org\/10.1016\/j.cor.2016.12.021","journal-title":"Comput Oper Res"},{"key":"5174_CR15","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.cor.2013.12.012","volume":"45","author":"V Fernandez-Viagas","year":"2014","unstructured":"Fernandez-Viagas V, Framinan JM (2014) On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem. Comput Oper Res 45:60\u201367. https:\/\/doi.org\/10.1016\/j.cor.2013.12.012","journal-title":"Comput Oper Res"},{"key":"5174_CR16","doi-asserted-by":"publisher","first-page":"104767","DOI":"10.1016\/j.cor.2019.104767","volume":"112","author":"V Fernandez-Viagas","year":"2019","unstructured":"Fernandez-Viagas V, Framinan JM (2019) A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective. Comput Oper Res 112:104767. https:\/\/doi.org\/10.1016\/j.cor.2019.104767","journal-title":"Comput Oper Res"},{"key":"5174_CR17","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E Taillard","year":"1990","unstructured":"Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47:65\u201374. https:\/\/doi.org\/10.1016\/0377-2217(90)90090-X","journal-title":"Eur J Oper Res"},{"key":"5174_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.omega.2013.10.002","volume":"44","author":"QK Pan","year":"2014","unstructured":"Pan QK, Ruiz R (2014) An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem. Omega (UK) 44:41\u201350. https:\/\/doi.org\/10.1016\/j.omega.2013.10.002","journal-title":"Omega (UK)"},{"key":"5174_CR19","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.cor.2018.07.017","volume":"100","author":"AJ Benavides","year":"2018","unstructured":"Benavides AJ, Ritt M (2018) Fast heuristics for minimizing the makespan in non-permutation flow shops. Comput Oper Res 100:230\u2013243. https:\/\/doi.org\/10.1016\/j.cor.2018.07.017","journal-title":"Comput Oper Res"},{"key":"5174_CR20","doi-asserted-by":"publisher","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"MF Tasgetiren","year":"2007","unstructured":"Tasgetiren MF, Liang Y-C, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177:1930\u20131947. https:\/\/doi.org\/10.1016\/j.ejor.2005.12.024","journal-title":"Eur J Oper Res"},{"key":"5174_CR21","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1016\/j.asoc.2011.09.021","volume":"12","author":"X Wang","year":"2012","unstructured":"Wang X, Tang L (2012) A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking. Appl Soft Comput J 12:652\u2013662. https:\/\/doi.org\/10.1016\/j.asoc.2011.09.021","journal-title":"Appl Soft Comput J"},{"key":"5174_CR22","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1007\/s00500-013-1199-z","volume":"18","author":"C-L Chen","year":"2014","unstructured":"Chen C-L, Huang S-Y, Tzeng Y-R, Chen C-L (2014) A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem. Soft Comput 18:2271\u20132282. https:\/\/doi.org\/10.1007\/s00500-013-1199-z","journal-title":"Soft Comput"},{"key":"5174_CR23","first-page":"977","volume":"9","author":"D Li","year":"2012","unstructured":"Li D, Deng N (2012) Solving permutation flow shop scheduling problem with a cooperative multi-swarm PSO algorithm. J Inf Comput Sci 9:977\u2013987","journal-title":"J Inf Comput Sci"},{"key":"5174_CR24","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/S0377-2217(02)00908-6","volume":"155","author":"C Rajendran","year":"2004","unstructured":"Rajendran C, Ziegler H (2004) Ant-colony algorithms for permutation flowshop scheduling to minimize makespan\/total flowtime of jobs. Eur J Oper Res 155:426\u2013438. https:\/\/doi.org\/10.1016\/S0377-2217(02)00908-6","journal-title":"Eur J Oper Res"},{"key":"5174_CR25","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.cie.2012.03.015","volume":"63","author":"F Ahmadizar","year":"2012","unstructured":"Ahmadizar F (2012) A new ant colony algorithm for makespan minimization in permutation flow shops. Comput Ind Eng 63:355\u2013361. https:\/\/doi.org\/10.1016\/j.cie.2012.03.015","journal-title":"Comput Ind Eng"},{"key":"5174_CR26","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:1891\u20131909. https:\/\/doi.org\/10.1016\/S0305-0548(03)00145-X","journal-title":"Comput Oper Res"},{"key":"5174_CR27","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.omega.2005.07.004","volume":"35","author":"J Grabowski","year":"2007","unstructured":"Grabowski J, Pempera J (2007) The permutation flow shop problem with blocking. A tabu search approach. Omega 35:302\u2013311. https:\/\/doi.org\/10.1016\/j.omega.2005.07.004","journal-title":"Omega"},{"key":"5174_CR28","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1016\/j.ejor.2004.07.020","volume":"167","author":"TK Varadharajan","year":"2005","unstructured":"Varadharajan TK, Rajendran C (2005) A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs. Eur J Oper Res 167:772\u2013795. https:\/\/doi.org\/10.1016\/j.ejor.2004.07.020","journal-title":"Eur J Oper Res"},{"key":"5174_CR29","doi-asserted-by":"publisher","first-page":"1625","DOI":"10.1016\/j.cor.2011.08.009","volume":"40","author":"S-W Lin","year":"2013","unstructured":"Lin S-W, Ying K-C (2013) Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm. Comput Oper Res 40:1625\u20131647. https:\/\/doi.org\/10.1016\/j.cor.2011.08.009","journal-title":"Comput Oper Res"},{"key":"5174_CR30","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1007\/s00170-007-1053-5","volume":"37","author":"M Saravanan","year":"2008","unstructured":"Saravanan M, Noorul Haq A, Vivekraj AR, Prasad T (2008) Performance evaluation of the scatter search method for permutation flowshop sequencing problems. Int J Adv Manuf Technol 37:1200\u20131208. https:\/\/doi.org\/10.1007\/s00170-007-1053-5","journal-title":"Int J Adv Manuf Technol"},{"key":"5174_CR31","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.cor.2015.01.005","volume":"60","author":"P Dasgupta","year":"2015","unstructured":"Dasgupta P, Das S (2015) A discrete inter-species cuckoo search for flowshop scheduling problems. Comput Oper Res 60:111\u2013120. https:\/\/doi.org\/10.1016\/j.cor.2015.01.005","journal-title":"Comput Oper Res"},{"key":"5174_CR32","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/j.cor.2008.01.007","volume":"36","author":"GI Zobolas","year":"2009","unstructured":"Zobolas GI, Tarantilis CD, Ioannou G (2009) Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Comput Oper Res 36:1249\u20131267. https:\/\/doi.org\/10.1016\/j.cor.2008.01.007","journal-title":"Comput Oper Res"},{"key":"5174_CR33","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ejor.2008.08.023","volume":"198","author":"L-Y Tseng","year":"2009","unstructured":"Tseng L-Y, Lin Y-T (2009) A hybrid genetic local search algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 198:84\u201392. https:\/\/doi.org\/10.1016\/j.ejor.2008.08.023","journal-title":"Eur J Oper Res"},{"key":"5174_CR34","doi-asserted-by":"publisher","first-page":"4217","DOI":"10.1080\/00207540802404364","volume":"48","author":"AN Haq","year":"2010","unstructured":"Haq AN, Ramanan TR, Shashikant KS, Sridharan R (2010) A hybrid neural network-genetic algorithm approach for permutation flow shop scheduling. Int J Prod Res 48:4217\u20134231. https:\/\/doi.org\/10.1080\/00207540802404364","journal-title":"Int J Prod Res"},{"key":"5174_CR35","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.cie.2007.11.018","volume":"55","author":"MS Nagano","year":"2008","unstructured":"Nagano MS, Ruiz R, Lorena LAN (2008) A constructive genetic algorithm for permutation flowshop scheduling. Comput Ind Eng 55:195\u2013207. https:\/\/doi.org\/10.1016\/j.cie.2007.11.018","journal-title":"Comput Ind Eng"},{"key":"5174_CR36","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1007\/s00170-004-2249-6","volume":"27","author":"T Pasupathy","year":"2006","unstructured":"Pasupathy T, Rajendran C, Suresh RK (2006) A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs. Int J Adv Manuf Technol 27:804\u2013815. https:\/\/doi.org\/10.1007\/s00170-004-2249-6","journal-title":"Int J Adv Manuf Technol"},{"key":"5174_CR37","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s00170-008-1845-2","volume":"44","author":"D Laha","year":"2009","unstructured":"Laha D, Chakraborty UK (2009) An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling. Int J Adv Manuf Technol 44:559\u2013569. https:\/\/doi.org\/10.1007\/s00170-008-1845-2","journal-title":"Int J Adv Manuf Technol"},{"key":"5174_CR38","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1007\/s00170-011-3671-1","volume":"60","author":"Y-R Tzeng","year":"2012","unstructured":"Tzeng Y-R, Chen C-L (2012) A hybrid EDA with ACS for solving permutation flow shop scheduling. Int J Adv Manuf Technol 60:1139\u20131147. https:\/\/doi.org\/10.1007\/s00170-011-3671-1","journal-title":"Int J Adv Manuf Technol"},{"key":"5174_CR39","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.cor.2013.09.014","volume":"52","author":"G Moslehi","year":"2014","unstructured":"Moslehi G, Khorasanian D (2014) A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion. Comput Oper Res 52:260\u2013268. https:\/\/doi.org\/10.1016\/j.cor.2013.09.014","journal-title":"Comput Oper Res"},{"key":"5174_CR40","doi-asserted-by":"publisher","first-page":"3759","DOI":"10.1007\/s00170-017-0679-1","volume":"93","author":"A Chakravorty","year":"2017","unstructured":"Chakravorty A, Laha D (2017) A heuristically directed immune algorithm to minimize makespan and total flow time in permutation flow shops. Int J Adv Manuf Technol 93:3759\u20133776. https:\/\/doi.org\/10.1007\/s00170-017-0679-1","journal-title":"Int J Adv Manuf Technol"},{"key":"5174_CR41","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.future.2018.03.020","volume":"85","author":"M Abdel-Basset","year":"2018","unstructured":"Abdel-Basset M, Manogaran G, El-Shahat D, Mirjalili S (2018) A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Futur Gener Comput Syst 85:129\u2013145. https:\/\/doi.org\/10.1016\/j.future.2018.03.020","journal-title":"Futur Gener Comput Syst"},{"key":"5174_CR42","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1016\/j.asoc.2011.10.024","volume":"13","author":"Y-F Liu","year":"2013","unstructured":"Liu Y-F, Liu S-Y (2013) A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem. Appl Soft Comput J 13:1459\u20131463. https:\/\/doi.org\/10.1016\/j.asoc.2011.10.024","journal-title":"Appl Soft Comput J"},{"key":"5174_CR43","doi-asserted-by":"crossref","unstructured":"Tasgetiren MF, Pan QK, Suganthan PN, Chen AHL (2010) A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion. 2010 IEEE World Congr Comput Intell WCCI 2010 - 2010 IEEE Congr Evol Comput CEC 2010. https:\/\/doi.org\/10.1109\/CEC.2010.5586300","DOI":"10.1109\/CEC.2010.5586300"},{"key":"5174_CR44","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Tech Rep TR06, Erciyes Univ"},{"key":"5174_CR45","doi-asserted-by":"publisher","first-page":"6758","DOI":"10.1016\/j.apm.2013.02.011","volume":"37","author":"MF Tasgetiren","year":"2013","unstructured":"Tasgetiren MF, Pan Q-K, Suganthan PN, Oner A (2013) A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Appl Math Model 37:6758\u20136779. https:\/\/doi.org\/10.1016\/j.apm.2013.02.011","journal-title":"Appl Math Model"},{"key":"5174_CR46","doi-asserted-by":"publisher","first-page":"1727","DOI":"10.1016\/j.cjche.2018.06.008","volume":"26","author":"K Peng","year":"2018","unstructured":"Peng K, Pan Q, Zhang B (2018) An improved artificial bee colony algorithm for steelmaking\u2013refining\u2013continuous casting scheduling problem. Chin J Chem Eng 26:1727\u20131735. https:\/\/doi.org\/10.1016\/j.cjche.2018.06.008","journal-title":"Chin J Chem Eng"},{"key":"5174_CR47","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1287\/opre.37.6.925","volume":"37","author":"ST McCormick","year":"1989","unstructured":"McCormick ST, Pinedo ML, Shenker S, Wolf B (1989) Sequencing in an assembly line with blocking to minimize cycle time. Oper Res 37:925\u2013935. https:\/\/doi.org\/10.1287\/opre.37.6.925","journal-title":"Oper Res"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05174-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-020-05174-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05174-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T19:37:27Z","timestamp":1627328247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-020-05174-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,27]]},"references-count":47,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["5174"],"URL":"https:\/\/doi.org\/10.1007\/s00521-020-05174-1","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,27]]},"assertion":[{"value":"28 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2020","order":3,"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 author declared that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}