{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:42:18Z","timestamp":1775068938048,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2018,4,19]],"date-time":"2018-04-19T00:00:00Z","timestamp":1524096000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004481","name":"University of Tehran","doi-asserted-by":"publisher","award":["8106013\/1\/11"],"award-info":[{"award-number":["8106013\/1\/11"]}],"id":[{"id":"10.13039\/501100004481","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00521-018-3368-6","type":"journal-article","created":{"date-parts":[[2018,4,19]],"date-time":"2018-04-19T20:08:05Z","timestamp":1524168485000},"page":"5327-5341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["An efficient simulation\u2013neural network\u2013genetic algorithm for flexible flow shops with sequence-dependent setup times, job deterioration and learning effects"],"prefix":"10.1007","volume":"31","author":[{"given":"A.","family":"Azadeh","sequence":"first","affiliation":[]},{"given":"A. Hasani","family":"Goodarzi","sequence":"additional","affiliation":[]},{"given":"M. Hasannia","family":"Kolaee","sequence":"additional","affiliation":[]},{"given":"S.","family":"Jebreili","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,19]]},"reference":[{"key":"3368_CR1","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1016\/j.cie.2008.09.004","volume":"56","author":"V Yaurima","year":"2009","unstructured":"Yaurima V, Burtseva L, Tchernykh A (2009) Hybrid flow shop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers. Comput Ind Eng 56:1452\u20131463","journal-title":"Comput Ind Eng"},{"issue":"3","key":"3368_CR2","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1002\/(SICI)1520-6750(200004)47:3<259::AID-NAV5>3.0.CO;2-K","volume":"47","author":"C Koulamas","year":"2000","unstructured":"Koulamas C, Kyparisis GJ (2000) Asymptotically optimal linear time algorithms for two-stage and three-stage flexible flow shops. Nav Res Logist (NRL) 47(3):259\u2013268","journal-title":"Nav Res Logist (NRL)"},{"key":"3368_CR3","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/s00170-007-0977-0","volume":"37","author":"J Jungwatanakit","year":"2008","unstructured":"Jungwatanakit J, Reodecha M, Chaovalitwongse P, Werner F (2008) Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Int J Adv Manuf Technol 37:354\u2013370","journal-title":"Int J Adv Manuf Technol"},{"issue":"24","key":"3368_CR4","doi-asserted-by":"publisher","first-page":"7401","DOI":"10.1080\/00207543.2011.649801","volume":"50","author":"M Iranpoor","year":"2012","unstructured":"Iranpoor M, Ghomi SF, Zandieh M (2012) Machine scheduling in the presence of sequence-dependent setup times and a rate-modifying activity. Int J Prod Res 50(24):7401\u20137414","journal-title":"Int J Prod Res"},{"key":"3368_CR5","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1057\/palgrave.jors.2601117","volume":"52","author":"A Kononov","year":"2001","unstructured":"Kononov A, Gawiejnowicz S (2001) NP-hard cases in scheduling deteriorating jobs on dedicated machines. J Oper Res Soc 52:708\u2013717","journal-title":"J Oper Res Soc"},{"key":"3368_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.mcm.2004.12.016","volume":"44","author":"M Dawande","year":"2006","unstructured":"Dawande M, Gavirneni S, Rachamadugu R (2006) Scheduling a two-stage flowshop under makespan constraint. Math Comput Model 44:73\u201384","journal-title":"Math Comput Model"},{"issue":"12","key":"3368_CR7","doi-asserted-by":"publisher","first-page":"3501","DOI":"10.1080\/00207543.2012.750771","volume":"51","author":"B Vahedi Nouri","year":"2013","unstructured":"Vahedi Nouri B, Fattahi P, Ramezanian R (2013) Hybrid firefly-simulated annealing algorithm for the flow shop problem with learning effects and flexible maintenance activities. Int J Prod Res 51(12):3501\u20133515","journal-title":"Int J Prod Res"},{"key":"3368_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.cor.2009.03.019","volume":"37","author":"CT Ng","year":"2010","unstructured":"Ng CT, Wang JB, Cheng TCE, Liu LL (2010) A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs. Comput Oper Res 37:83\u201390","journal-title":"Comput Oper Res"},{"key":"3368_CR9","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/S0377-2217(00)00142-9","volume":"132","author":"M Azizoglu","year":"2001","unstructured":"Azizoglu M, Cakmak E, Kondakci S (2001) A flexible flow shop problem with total flow time minimization. Eur J Oper Res 132:528\u2013538","journal-title":"Eur J Oper Res"},{"key":"3368_CR10","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/j.orl.2004.10.004","volume":"33","author":"Z Wang","year":"2005","unstructured":"Wang Z, Xing W, Bai F (2005) No-wait flexible flow shop scheduling with no-idle machines. Oper Res Lett 33:609\u2013614","journal-title":"Oper Res Lett"},{"issue":"4","key":"3368_CR11","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1243\/09544054JEM989","volume":"222","author":"QK Pan","year":"2008","unstructured":"Pan QK, Wang L, Qian B (2008) A novel multi-objective particle swarm optimization algorithm for no-wait flow shop scheduling problems. Proc Inst Mech Eng Part B J Eng Manuf 222(4):519\u2013539","journal-title":"Proc Inst Mech Eng Part B J Eng Manuf"},{"key":"3368_CR12","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.amc.2006.05.106","volume":"183","author":"B Akrami","year":"2006","unstructured":"Akrami B, Karimi B, Moattar Hosseini SM (2006) Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case. Appl Math Comput 183:634\u2013645","journal-title":"Appl Math Comput"},{"key":"3368_CR13","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.engappai.2010.01.008","volume":"23","author":"S Khalouli","year":"2010","unstructured":"Khalouli S, Ghedjati F, Hamzaoui A (2010) A meta-heuristic approach to solve a JIT scheduling problem in hybrid. Eng Appl Artif Intell 23:765\u2013771","journal-title":"Eng Appl Artif Intell"},{"key":"3368_CR14","doi-asserted-by":"publisher","first-page":"10295","DOI":"10.1016\/j.eswa.2009.01.047","volume":"36","author":"WC Lee","year":"2009","unstructured":"Lee WC, Wu CC, Liu MF (2009) A single-machine bi-criterion learning scheduling problem with release times. Expert Syst Appl 36:10295\u201310303","journal-title":"Expert Syst Appl"},{"key":"3368_CR15","first-page":"67","volume":"26","author":"TC Lai","year":"1997","unstructured":"Lai TC, Sotskov YN, Werner F (1997) Optimal make span scheduling with given bounds of processing times. Math Comput Model 26:67\u201386","journal-title":"Math Comput Model"},{"key":"3368_CR16","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1057\/palgrave.jors.2600690","volume":"50","author":"TC Lai","year":"1999","unstructured":"Lai TC, Sotskov YN (1999) Sequencing with uncertain numerical data for make span minimization. J Oper Res Soc 50:230\u2013243","journal-title":"J Oper Res Soc"},{"key":"3368_CR17","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1111\/1475-3995.00393","volume":"10","author":"A Allahverdi","year":"2003","unstructured":"Allahverdi A, Sotskov YN (2003) Two-machine flow shop minimum length scheduling problem with random and bounded processing times. Int Trans Oper Res 10:65\u201376","journal-title":"Int Trans Oper Res"},{"key":"3368_CR18","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1016\/j.mcm.2008.02.004","volume":"49","author":"NM Matsveichuk","year":"2009","unstructured":"Matsveichuk NM, Sotskov YN, Egorova NG, Lai TC (2009) Schedule execution for two-machine flow-shop with interval processing times. Math Comput Model 49:991\u20131011","journal-title":"Math Comput Model"},{"key":"3368_CR19","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.ijpe.2005.10.002","volume":"103","author":"A Allahverdi","year":"2006","unstructured":"Allahverdi A (2006) Two-machine flow shop scheduling problem to minimize total completion time with bounded setup and processing times. Int J Prod Econ 103:386\u2013400","journal-title":"Int J Prod Econ"},{"key":"3368_CR20","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.ijpe.2012.09.014","volume":"145","author":"C Almeder","year":"2013","unstructured":"Almeder C, Hartl RF (2013) A metaheuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer. Int J Prod Econ 145:88\u201395","journal-title":"Int J Prod Econ"},{"key":"3368_CR21","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.cor.2013.09.013","volume":"43","author":"K Wang","year":"2014","unstructured":"Wang K, Choi SH (2014) A holonic approach to flexible flow shop scheduling under stochastic processing times. Comput Oper Res 43:157\u2013168","journal-title":"Comput Oper Res"},{"key":"3368_CR22","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1016\/j.engappai.2011.12.004","volume":"25","author":"K Kianfar","year":"2012","unstructured":"Kianfar K, Fatemi Ghomi SMT, Oroojlooy Jadid A (2012) Study of stochastic sequence-dependent flexible flow shop via developing a dispatching rule and a hybrid GA. Eng Appl Artif Intell 25:494\u2013506","journal-title":"Eng Appl Artif Intell"},{"key":"3368_CR23","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0098-1354(98)00296-8","volume":"23","author":"SJ Honkomp","year":"1999","unstructured":"Honkomp SJ, Mockus L, Reklaitis GV (1999) A framework for schedule evaluation with processing uncertainty. Comput Chem Eng 23:595\u2013609","journal-title":"Comput Chem Eng"},{"key":"3368_CR24","doi-asserted-by":"publisher","first-page":"7609","DOI":"10.1016\/j.eswa.2010.12.101","volume":"38","author":"H Khademi Zare","year":"2011","unstructured":"Khademi Zare H, 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":"3368_CR25","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s00170-015-6795-x","volume":"79","author":"A Azadeh","year":"2015","unstructured":"Azadeh A, Hosseini N, Abdolhossein Zadeh S, Jalalvand F (2015) A hybrid computer simulation-adaptive neuro-fuzzy inference system algorithm for optimization of dispatching rule selection in job shop scheduling problems under uncertainty. Int J Adv Manuf Technol 79:135\u2013145","journal-title":"Int J Adv Manuf Technol"},{"issue":"6","key":"3368_CR26","doi-asserted-by":"publisher","first-page":"4195","DOI":"10.1016\/j.asoc.2011.03.013","volume":"11","author":"J Rezaeian","year":"2011","unstructured":"Rezaeian J, Javadian N, Tavakkoli-Moghaddam R, Jolai F (2011) A hybrid approach based on the genetic algorithm and neural network to design an incremental cellular manufacturing system. Appl Soft Comput 11(6):4195\u20134202","journal-title":"Appl Soft Comput"},{"key":"3368_CR27","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0377-2217(02)00835-4","volume":"151","author":"M Gourgand","year":"2003","unstructured":"Gourgand M, Grangeon N, Norre S (2003) A contribution to the stochastic flow shop scheduling problem. Eur J Oper Res 151:415\u2013433","journal-title":"Eur J Oper Res"},{"key":"3368_CR28","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.amc.2005.11.136","volume":"180","author":"M Zandieh","year":"2006","unstructured":"Zandieh M, Fatemi Ghomi SMT, Moattar Husseini SM (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Appl Math Comput 180:111\u2013127","journal-title":"Appl Math Comput"},{"key":"3368_CR29","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/opre.38.3.495","volume":"38","author":"S Browne","year":"1990","unstructured":"Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495\u2013498","journal-title":"Oper Res"},{"key":"3368_CR30","doi-asserted-by":"publisher","first-page":"3848","DOI":"10.1016\/j.apm.2009.01.004","volume":"33","author":"JB Wang","year":"2009","unstructured":"Wang JB, Huang X, Wang XY, Yin N, Wang LY (2009) Learning effect and deteriorating jobs in the single machine scheduling problems. Appl Math Model 33:3848\u20133853","journal-title":"Appl Math Model"},{"key":"3368_CR31","doi-asserted-by":"crossref","first-page":"2069","DOI":"10.1016\/j.amc.2011.07.023","volume":"218","author":"DL Yang","year":"2011","unstructured":"Yang DL, Kuo WH (2011) Scheduling with deteriorating jobs and learning effects. Appl Math Comput 218:2069\u20132073","journal-title":"Appl Math Comput"},{"key":"3368_CR32","doi-asserted-by":"publisher","first-page":"8865","DOI":"10.1016\/j.apm.2013.04.008","volume":"37","author":"C Low","year":"2013","unstructured":"Low C, Lin WY (2013) Some scheduling problems with time-dependent learning effect and deteriorating jobs. Appl Math Model 37:8865\u20138875","journal-title":"Appl Math Model"},{"key":"3368_CR33","doi-asserted-by":"publisher","first-page":"5231","DOI":"10.1016\/j.apm.2014.04.002","volume":"38","author":"XY Wang","year":"2014","unstructured":"Wang XY, Wang JJ (2014) Scheduling deteriorating jobs with a learning effect on unrelated parallel machines. Appl Math Model 38:5231\u20135238","journal-title":"Appl Math Model"},{"key":"3368_CR34","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0377-2217(96)00041-0","volume":"93","author":"L Sabuncuoglu","year":"1996","unstructured":"Sabuncuoglu L, Gurgun B (1996) A neural network model for scheduling problems. Eur J Oper Res 93:288\u2013299","journal-title":"Eur J Oper Res"},{"key":"3368_CR35","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/j.cie.2004.05.005","volume":"46","author":"DE Akyol","year":"2004","unstructured":"Akyol DE (2004) Application of neural networks to heuristic scheduling algorithms. Comput Ind Eng 46:679\u2013696","journal-title":"Comput Ind Eng"},{"key":"3368_CR36","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1177\/1063293X09352121","volume":"17","author":"T Chiang","year":"2009","unstructured":"Chiang T (2009) The minimum-cost PD process planning and control methodology with the consideration of resource\/time constraints and skill levels. Concur Eng Res Appl 17:257\u2013266","journal-title":"Concur Eng Res Appl"},{"key":"3368_CR37","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1177\/1063293X11424512","volume":"19","author":"SM Asadzadeh","year":"2011","unstructured":"Asadzadeh SM, Azadeh A, Ziaeifar A (2011) A neuro-fuzzy-regression algorithm for improved prediction of manufacturing lead time with machine breakdowns. Concur Eng Res Appl 19:269\u2013281","journal-title":"Concur Eng Res Appl"},{"key":"3368_CR38","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1177\/0954405414563554","volume":"230","author":"H Seidgar","year":"2015","unstructured":"Seidgar H, Zandieh M, Fazlollahtabar H, Mahdavi I (2015) Simulated imperialist competitive algorithm in two-stage assembly flow shop with machine breakdowns and preventive maintenance. Proc Inst Mech Eng Part B J Eng Manuf 230:934\u2013953","journal-title":"Proc Inst Mech Eng Part B J Eng Manuf"},{"key":"3368_CR39","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.cie.2008.04.008","volume":"56","author":"E Figielska","year":"2009","unstructured":"Figielska E (2009) A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flow shop with additional resources. Comput Ind Eng 56:142\u2013151","journal-title":"Comput Ind Eng"},{"key":"3368_CR40","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1016\/j.apm.2010.07.057","volume":"35","author":"J Behnamian","year":"2011","unstructured":"Behnamian J, Fatemi Ghomi SMT (2011) Hybrid flowshop scheduling with machine and resource-dependent processing times. Appl Math Model 35:1107\u20131123","journal-title":"Appl Math Model"},{"key":"3368_CR41","doi-asserted-by":"publisher","first-page":"1629","DOI":"10.1016\/j.camwa.2005.07.008","volume":"50","author":"J Xie","year":"2005","unstructured":"Xie J, Wang X (2005) Complexity and algorithms for two-stage flexible flow shop scheduling with availability constraints. Comput Math Appl 50:1629\u20131638","journal-title":"Comput Math Appl"},{"key":"3368_CR42","first-page":"651","volume":"5092","author":"H Gong","year":"2008","unstructured":"Gong H, Tang L (2008) A two-stage flexible flow shop problem with deterioration. Comput Comb Lect Notes Comput Sci 5092:651\u2013660","journal-title":"Comput Comb Lect Notes Comput Sci"},{"key":"3368_CR43","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0377-2217(03)00401-6","volume":"159","author":"ME Kurz","year":"2004","unstructured":"Kurz ME, Askin RG (2004) Scheduling flexible flow lines with sequence-dependent setup times. Eur J Oper Res 159:66\u201382","journal-title":"Eur J Oper Res"},{"key":"3368_CR44","first-page":"83","volume":"3","author":"WC Lee","year":"2004","unstructured":"Lee WC (2004) A note on deteriorating jobs and learning in single-machine scheduling problems. Int J Bus Econ 3:83\u201389","journal-title":"Int J Bus Econ"},{"issue":"12","key":"3368_CR45","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1080\/00207720600879260","volume":"37","author":"JB Wang","year":"2006","unstructured":"Wang JB (2006) A note on scheduling problems with learning effect and deteriorating jobs. Int J Syst Sci 37(12):827\u2013833","journal-title":"Int J Syst Sci"},{"issue":"1","key":"3368_CR46","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.cie.2009.06.016","volume":"58","author":"DL Yang","year":"2010","unstructured":"Yang DL, Kuo WH (2010) Some scheduling problems with deteriorating jobs and learning effects. Comput Ind Eng 58(1):25\u201328","journal-title":"Comput Ind Eng"},{"key":"3368_CR47","volume-title":"Simulation with visual Slam and AweSim","author":"AB Pristker","year":"1999","unstructured":"Pristker AB, O\u2019Reilly JJ, Laval DK (1999) Simulation with visual Slam and AweSim. Wiley, New York"},{"issue":"1","key":"3368_CR48","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.asoc.2009.12.021","volume":"11","author":"A Azadeh","year":"2011","unstructured":"Azadeh A, Faiz ZS (2011) A meta-heuristic framework for forecasting household electricity consumption. Appl Soft Comput 11(1):614\u2013620","journal-title":"Appl Soft Comput"},{"issue":"2","key":"3368_CR49","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.asoc.2006.03.004","volume":"7","author":"HJ Kim","year":"2007","unstructured":"Kim HJ, Shin KS (2007) A hybrid approach based on neural networks and genetic algorithms for detecting temporal patterns in stock markets. Appl Soft Comput 7(2):569\u2013576","journal-title":"Appl Soft Comput"},{"key":"3368_CR50","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1016\/j.eswa.2010.07.033","volume":"38","author":"A Azadeh","year":"2011","unstructured":"Azadeh A, Saberi M, Tavakkoli Moghaddama R, Javanmardi L (2011) An integrated data envelopment analysis-artificial neural network-rough set algorithm for assessment of personnel efficiency. Expert Syst Appl 38:1364\u20131373","journal-title":"Expert Syst Appl"},{"key":"3368_CR51","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ijpe.2010.06.006","volume":"128","author":"LY Tseng","year":"2010","unstructured":"Tseng LY, Lin YT (2010) A hybrid genetic algorithm for no-wait flow shop scheduling problem. Int J Prod Econ 128:144\u2013152","journal-title":"Int J Prod Econ"},{"key":"3368_CR52","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.asoc.2014.10.002","volume":"26","author":"B Kaushik","year":"2015","unstructured":"Kaushik B, Banka H (2015) Performance evaluation of approximated artificial neural network (AANN) algorithm for reliability improvement. Appl Soft Comput 26:303\u2013314","journal-title":"Appl Soft Comput"},{"key":"3368_CR53","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0305-0548(00)00061-7","volume":"29","author":"JND Gupta","year":"2002","unstructured":"Gupta JND, Hennig K, Werner F (2002) Local search heuristics for two-stage flow shop problems with secondary criterion. Comput Oper Res 29:123\u2013149","journal-title":"Comput Oper Res"},{"key":"3368_CR54","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-015-1084-y","author":"HC Chang","year":"2015","unstructured":"Chang HC, Liu TK (2015) Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms. J Intell Manuf. https:\/\/doi.org\/10.1007\/s10845-015-1084-y","journal-title":"J Intell Manuf"},{"key":"3368_CR55","volume-title":"Industrial scheduling","author":"DR Sule","year":"1997","unstructured":"Sule DR (1997) Industrial scheduling. PWS Publishing Company, Boston"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3368-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-018-3368-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3368-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T01:01:21Z","timestamp":1604192481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-018-3368-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,19]]},"references-count":55,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["3368"],"URL":"https:\/\/doi.org\/10.1007\/s00521-018-3368-6","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,19]]},"assertion":[{"value":"14 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2018","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 authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}