An efficient simulation–neural network–genetic algorithm for flexible flow shops with sequence-dependent setup times, job deterioration and learning effects
This study presents an integrated approach based on artificial neural network (ANN), genetic algorithm (GA) and computer simulation to explore all the solution space in stochastic flexible flow shop with sequence-dependent setup times, job deterioration and learning effects. The objective of this st...
        Saved in:
      
    
          | Published in | Neural computing & applications Vol. 31; no. 9; pp. 5327 - 5341 | 
|---|---|
| Main Authors | , , , | 
| Format | Journal Article | 
| Language | English | 
| Published | 
        London
          Springer London
    
        01.09.2019
     Springer Nature B.V  | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 0941-0643 1433-3058  | 
| DOI | 10.1007/s00521-018-3368-6 | 
Cover
| Abstract | This study presents an integrated approach based on artificial neural network (ANN), genetic algorithm (GA) and computer simulation to explore all the solution space in stochastic flexible flow shop with sequence-dependent setup times, job deterioration and learning effects. The objective of this study is minimizing total tardiness of jobs in the sequences. In this study, the outputs of ANN are inputted to GA and outputs of simulation model are inputted to ANN. We consider learning effects in this problem which means that workers become more experienced with the passage of time, and thus, the processing duration decreases. Deterioration of job means that processing time is a decreasing function of its execution start time. It is not possible to propose a mathematical optimization model for the stated problem; therefore, a simulation optimization approach based on ANN–GA is introduced for a relatively large problem. Finally, actual experiments are conducted to show the applicability of the proposed novel algorithm in finding near-optimal solutions with normal, uniform and exponential processing and setup times. This is the first study that presents an integrated intelligent approach for optimal solution of stochastic flexible flow shop problem with sequence-dependent setup times, job deterioration and learning effects in a real case study. | 
    
|---|---|
| AbstractList | This study presents an integrated approach based on artificial neural network (ANN), genetic algorithm (GA) and computer simulation to explore all the solution space in stochastic flexible flow shop with sequence-dependent setup times, job deterioration and learning effects. The objective of this study is minimizing total tardiness of jobs in the sequences. In this study, the outputs of ANN are inputted to GA and outputs of simulation model are inputted to ANN. We consider learning effects in this problem which means that workers become more experienced with the passage of time, and thus, the processing duration decreases. Deterioration of job means that processing time is a decreasing function of its execution start time. It is not possible to propose a mathematical optimization model for the stated problem; therefore, a simulation optimization approach based on ANN–GA is introduced for a relatively large problem. Finally, actual experiments are conducted to show the applicability of the proposed novel algorithm in finding near-optimal solutions with normal, uniform and exponential processing and setup times. This is the first study that presents an integrated intelligent approach for optimal solution of stochastic flexible flow shop problem with sequence-dependent setup times, job deterioration and learning effects in a real case study. | 
    
| Author | Goodarzi, A. Hasani Kolaee, M. Hasannia Azadeh, A. Jebreili, S.  | 
    
| Author_xml | – sequence: 1 givenname: A. surname: Azadeh fullname: Azadeh, A. organization: School of Industrial and Systems Engineering, Center of Excellence for Intelligent Based Experimental Mechanic, University of Tehran, Department of Engineering Research, College of Engineering, University of Tehran – sequence: 2 givenname: A. Hasani surname: Goodarzi fullname: Goodarzi, A. Hasani email: Asefeh.hasani@modares.ac.ir organization: Faculty of Industrial and Systems Engineering, Tarbiat Modares University – sequence: 3 givenname: M. Hasannia surname: Kolaee fullname: Kolaee, M. Hasannia organization: School of Industrial and Systems Engineering, Center of Excellence for Intelligent Based Experimental Mechanic, University of Tehran, Department of Engineering Research, College of Engineering, University of Tehran – sequence: 4 givenname: S. surname: Jebreili fullname: Jebreili, S. organization: School of Industrial and Systems Engineering, Center of Excellence for Intelligent Based Experimental Mechanic, University of Tehran, Department of Engineering Research, College of Engineering, University of Tehran  | 
    
| BookMark | eNp9kU1qHDEQhUWwIeOfA2Qn8DYdl35a3b00JnECA9nEa6FRV4816ZE6kppxdr6DL5Cz5STRzBgCAWelQvW-qke9M3Lig0dC3jH4wACa6wRQc1YBayshVFupN2TBpBCVgLo9IQvoZOkqKd6Ss5Q2ACBVWy_IrxtPcRicdegzTW47jya74H8_PXucoxmpx7wL8Xv5WGOpnaVmXIfo8sOWDiHSYcRHtxqxFGFH00OYEt2VLk34Y0ZvsepxQt8f5mOeJ5rdFtN7ugkr2mPG6EI87KTG93REE73z670rtDldkNPBjAkvX95zcv_p47fbz9Xy692X25tlZYXqcsWUYmha0SloVQ8WGxSyaVq7ArkygxhAcADGuG1qZfpWSWml4rycx_KecXFOro5zpxiK75T1JszRl5Wa864TjahVV1TNUWVjSCnioK3LB_M5GjdqBnofhz7GoUsceh-HVoVk_5BTdFsTf_6X4UcmFa1fY_zr6XXoD1CZo9g | 
    
| CitedBy_id | crossref_primary_10_1080_21681015_2023_2167875 crossref_primary_10_3233_JIFS_230076 crossref_primary_10_1007_s00521_020_05075_3 crossref_primary_10_1016_j_cor_2022_105863 crossref_primary_10_1016_j_cie_2022_108624 crossref_primary_10_1155_2022_8682203 crossref_primary_10_1016_j_cie_2022_108786 crossref_primary_10_3390_pr11123321 crossref_primary_10_1016_j_cie_2023_109817 crossref_primary_10_1016_j_cie_2024_110835 crossref_primary_10_1016_j_engappai_2021_104503 crossref_primary_10_1007_s00500_019_03970_z  | 
    
| Cites_doi | 10.1016/j.cie.2004.05.005 10.1016/j.orl.2004.10.004 10.1016/j.apm.2013.04.008 10.1016/j.cie.2008.09.004 10.1057/palgrave.jors.2600690 10.1016/j.asoc.2011.03.013 10.1016/0377-2217(96)00041-0 10.1016/j.eswa.2010.12.101 10.1243/09544054JEM989 10.1016/j.eswa.2010.07.033 10.1016/j.apm.2009.01.004 10.1002/(SICI)1520-6750(200004)47:3<259::AID-NAV5>3.0.CO;2-K 10.1016/S0377-2217(00)00142-9 10.1016/j.asoc.2006.03.004 10.1016/j.mcm.2004.12.016 10.1016/j.engappai.2010.01.008 10.1007/s00170-015-6795-x 10.1080/00207720600879260 10.1111/1475-3995.00393 10.1016/j.ijpe.2012.09.014 10.1016/j.ijpe.2005.10.002 10.1016/j.camwa.2005.07.008 10.1080/00207543.2012.750771 10.1016/j.asoc.2009.12.021 10.1016/S0377-2217(02)00835-4 10.1016/j.apm.2014.04.002 10.1177/1063293X11424512 10.1016/j.apm.2010.07.057 10.1057/palgrave.jors.2601117 10.1016/j.cie.2009.06.016 10.1080/00207543.2011.649801 10.1016/j.cor.2009.03.019 10.1016/j.ijpe.2010.06.006 10.1177/1063293X09352121 10.1007/s10845-015-1084-y 10.1016/S0098-1354(98)00296-8 10.1016/S0305-0548(00)00061-7 10.1016/j.cor.2013.09.013 10.1287/opre.38.3.495 10.1177/0954405414563554 10.1016/j.mcm.2008.02.004 10.1016/j.cie.2008.04.008 10.1016/j.asoc.2014.10.002 10.1016/S0377-2217(03)00401-6 10.1016/j.eswa.2009.01.047 10.1016/j.engappai.2011.12.004 10.1007/s00170-007-0977-0 10.1016/j.amc.2005.11.136 10.1016/j.amc.2006.05.106 10.1016/j.amc.2011.07.023  | 
    
| ContentType | Journal Article | 
    
| Copyright | The Natural Computing Applications Forum 2018 Neural Computing and Applications is a copyright of Springer, (2018). All Rights Reserved.  | 
    
| Copyright_xml | – notice: The Natural Computing Applications Forum 2018 – notice: Neural Computing and Applications is a copyright of Springer, (2018). All Rights Reserved.  | 
    
| DBID | AAYXX CITATION 8FE 8FG AFKRA ARAPS BENPR BGLVJ CCPQU DWQXO HCIFZ P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS  | 
    
| DOI | 10.1007/s00521-018-3368-6 | 
    
| DatabaseName | CrossRef ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Technology Collection ProQuest One Community College ProQuest Central Korea SciTech Premium Collection Advanced Technologies & Aerospace Collection ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China  | 
    
| DatabaseTitle | CrossRef Advanced Technologies & Aerospace Collection Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest One Academic Eastern Edition SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central Advanced Technologies & Aerospace Database ProQuest One Applied & Life Sciences ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New)  | 
    
| DatabaseTitleList | Advanced Technologies & Aerospace Collection | 
    
| Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database  | 
    
| DeliveryMethod | fulltext_linktorsrc | 
    
| Discipline | Computer Science | 
    
| EISSN | 1433-3058 | 
    
| EndPage | 5341 | 
    
| ExternalDocumentID | 10_1007_s00521_018_3368_6 | 
    
| GrantInformation_xml | – fundername: University of Tehran grantid: 8106013/1/11 funderid: http://dx.doi.org/10.13039/501100004481  | 
    
| GroupedDBID | -4Z -59 -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 123 1N0 1SB 2.D 203 28- 29N 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 53G 5QI 5VS 67Z 6NX 8FE 8FG 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. B0M BA0 BBWZM BDATZ BENPR BGLVJ BGNMA BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EAD EAP EBLON EBS ECS EDO EIOEI EJD EMI EMK EPL ESBYG EST ESX F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF0 PT4 PT5 QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z5O Z7R Z7S Z7V Z7W Z7X Z7Y Z7Z Z81 Z83 Z86 Z88 Z8M Z8N Z8P Z8Q Z8R Z8S Z8T Z8U Z8W Z92 ZMTXR ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG ADKFA AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB PUEGO DWQXO PKEHL PQEST PQQKQ PQUKI PRINS  | 
    
| ID | FETCH-LOGICAL-c369t-1661ea8396086d0ce7e34778cb04baf3f03200112c756ad8644c4622305c2d123 | 
    
| IEDL.DBID | BENPR | 
    
| ISSN | 0941-0643 | 
    
| IngestDate | Fri Jul 25 06:27:39 EDT 2025 Thu Apr 24 23:05:13 EDT 2025 Wed Oct 01 02:25:51 EDT 2025 Fri Feb 21 02:35:43 EST 2025  | 
    
| IsPeerReviewed | true | 
    
| IsScholarly | true | 
    
| Issue | 9 | 
    
| Keywords | Learning effects Deterioration of jobs Artificial neural network Genetic algorithm Dependent setup times Flexible flow shop  | 
    
| Language | English | 
    
| LinkModel | DirectLink | 
    
| MergedId | FETCHMERGED-LOGICAL-c369t-1661ea8396086d0ce7e34778cb04baf3f03200112c756ad8644c4622305c2d123 | 
    
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14  | 
    
| PQID | 2299373569 | 
    
| PQPubID | 2043988 | 
    
| PageCount | 15 | 
    
| ParticipantIDs | proquest_journals_2299373569 crossref_citationtrail_10_1007_s00521_018_3368_6 crossref_primary_10_1007_s00521_018_3368_6 springer_journals_10_1007_s00521_018_3368_6  | 
    
| ProviderPackageCode | CITATION AAYXX  | 
    
| PublicationCentury | 2000 | 
    
| PublicationDate | 2019-09-01 | 
    
| PublicationDateYYYYMMDD | 2019-09-01 | 
    
| PublicationDate_xml | – month: 09 year: 2019 text: 2019-09-01 day: 01  | 
    
| PublicationDecade | 2010 | 
    
| PublicationPlace | London | 
    
| PublicationPlace_xml | – name: London – name: Heidelberg  | 
    
| PublicationTitle | Neural computing & applications | 
    
| PublicationTitleAbbrev | Neural Comput & Applic | 
    
| PublicationYear | 2019 | 
    
| Publisher | Springer London Springer Nature B.V  | 
    
| Publisher_xml | – name: Springer London – name: Springer Nature B.V  | 
    
| References | Gourgand, Grangeon, Norre (CR27) 2003; 151 Tseng, Lin (CR51) 2010; 128 Kononov, Gawiejnowicz (CR5) 2001; 52 Yaurima, Burtseva, Tchernykh (CR1) 2009; 56 Wang, Choi (CR21) 2014; 43 Iranpoor, Ghomi, Zandieh (CR4) 2012; 50 Low, Lin (CR32) 2013; 37 Chiang (CR36) 2009; 17 Lai, Sotskov (CR16) 1999; 50 Azadeh, Faiz (CR48) 2011; 11 Wang (CR45) 2006; 37 Dawande, Gavirneni, Rachamadugu (CR6) 2006; 44 Kianfar, Fatemi Ghomi, Oroojlooy Jadid (CR22) 2012; 25 Khademi Zare, Fakhrzad (CR24) 2011; 38 Allahverdi (CR19) 2006; 103 Chang, Liu (CR54) 2015 Wang, Wang (CR33) 2014; 38 Almeder, Hartl (CR20) 2013; 145 Seidgar, Zandieh, Fazlollahtabar, Mahdavi (CR38) 2015; 230 Jungwatanakit, Reodecha, Chaovalitwongse, Werner (CR3) 2008; 37 Azizoglu, Cakmak, Kondakci (CR9) 2001; 132 Matsveichuk, Sotskov, Egorova, Lai (CR18) 2009; 49 Wang, Huang, Wang, Yin, Wang (CR30) 2009; 33 Honkomp, Mockus, Reklaitis (CR23) 1999; 23 Zandieh, Fatemi Ghomi, Moattar Husseini (CR28) 2006; 180 Allahverdi, Sotskov (CR17) 2003; 10 Azadeh, Saberi, Tavakkoli Moghaddama, Javanmardi (CR50) 2011; 38 Gong, Tang (CR42) 2008; 5092 Kurz, Askin (CR43) 2004; 159 Akyol (CR35) 2004; 46 Pan, Wang, Qian (CR11) 2008; 222 Akrami, Karimi, Moattar Hosseini (CR12) 2006; 183 Lai, Sotskov, Werner (CR15) 1997; 26 Azadeh, Hosseini, Abdolhossein Zadeh, Jalalvand (CR25) 2015; 79 Kaushik, Banka (CR52) 2015; 26 Yang, Kuo (CR31) 2011; 218 Figielska (CR39) 2009; 56 Browne, Yechiali (CR29) 1990; 38 Sabuncuoglu, Gurgun (CR34) 1996; 93 Asadzadeh, Azadeh, Ziaeifar (CR37) 2011; 19 Wang, Xing, Bai (CR10) 2005; 33 Lee, Wu, Liu (CR14) 2009; 36 Lee (CR44) 2004; 3 Pristker, O’Reilly, Laval (CR47) 1999 Sule (CR55) 1997 Rezaeian, Javadian, Tavakkoli-Moghaddam, Jolai (CR26) 2011; 11 Gupta, Hennig, Werner (CR53) 2002; 29 Khalouli, Ghedjati, Hamzaoui (CR13) 2010; 23 Vahedi Nouri, Fattahi, Ramezanian (CR7) 2013; 51 Ng, Wang, Cheng, Liu (CR8) 2010; 37 Xie, Wang (CR41) 2005; 50 Koulamas, Kyparisis (CR2) 2000; 47 Behnamian, Fatemi Ghomi (CR40) 2011; 35 Kim, Shin (CR49) 2007; 7 Yang, Kuo (CR46) 2010; 58 TC Lai (3368_CR16) 1999; 50 A Azadeh (3368_CR50) 2011; 38 J Behnamian (3368_CR40) 2011; 35 M Zandieh (3368_CR28) 2006; 180 C Koulamas (3368_CR2) 2000; 47 Z Wang (3368_CR10) 2005; 33 A Azadeh (3368_CR48) 2011; 11 J Jungwatanakit (3368_CR3) 2008; 37 C Almeder (3368_CR20) 2013; 145 H Seidgar (3368_CR38) 2015; 230 DL Yang (3368_CR46) 2010; 58 C Low (3368_CR32) 2013; 37 HC Chang (3368_CR54) 2015 M Iranpoor (3368_CR4) 2012; 50 LY Tseng (3368_CR51) 2010; 128 QK Pan (3368_CR11) 2008; 222 DL Yang (3368_CR31) 2011; 218 A Allahverdi (3368_CR17) 2003; 10 J Xie (3368_CR41) 2005; 50 H Khademi Zare (3368_CR24) 2011; 38 WC Lee (3368_CR44) 2004; 3 XY Wang (3368_CR33) 2014; 38 TC Lai (3368_CR15) 1997; 26 SJ Honkomp (3368_CR23) 1999; 23 V Yaurima (3368_CR1) 2009; 56 A Azadeh (3368_CR25) 2015; 79 S Browne (3368_CR29) 1990; 38 M Dawande (3368_CR6) 2006; 44 S Khalouli (3368_CR13) 2010; 23 AB Pristker (3368_CR47) 1999 DE Akyol (3368_CR35) 2004; 46 J Rezaeian (3368_CR26) 2011; 11 M Azizoglu (3368_CR9) 2001; 132 ME Kurz (3368_CR43) 2004; 159 K Kianfar (3368_CR22) 2012; 25 NM Matsveichuk (3368_CR18) 2009; 49 JB Wang (3368_CR30) 2009; 33 A Allahverdi (3368_CR19) 2006; 103 B Kaushik (3368_CR52) 2015; 26 CT Ng (3368_CR8) 2010; 37 T Chiang (3368_CR36) 2009; 17 WC Lee (3368_CR14) 2009; 36 L Sabuncuoglu (3368_CR34) 1996; 93 E Figielska (3368_CR39) 2009; 56 K Wang (3368_CR21) 2014; 43 SM Asadzadeh (3368_CR37) 2011; 19 M Gourgand (3368_CR27) 2003; 151 HJ Kim (3368_CR49) 2007; 7 JND Gupta (3368_CR53) 2002; 29 JB Wang (3368_CR45) 2006; 37 B Vahedi Nouri (3368_CR7) 2013; 51 H Gong (3368_CR42) 2008; 5092 B Akrami (3368_CR12) 2006; 183 A Kononov (3368_CR5) 2001; 52 DR Sule (3368_CR55) 1997  | 
    
| References_xml | – volume: 46 start-page: 679 year: 2004 end-page: 696 ident: CR35 article-title: Application of neural networks to heuristic scheduling algorithms publication-title: Comput Ind Eng doi: 10.1016/j.cie.2004.05.005 – volume: 33 start-page: 609 year: 2005 end-page: 614 ident: CR10 article-title: No-wait flexible flow shop scheduling with no-idle machines publication-title: Oper Res Lett doi: 10.1016/j.orl.2004.10.004 – volume: 3 start-page: 83 year: 2004 end-page: 89 ident: CR44 article-title: A note on deteriorating jobs and learning in single-machine scheduling problems publication-title: Int J Bus Econ – volume: 37 start-page: 8865 year: 2013 end-page: 8875 ident: CR32 article-title: Some scheduling problems with time-dependent learning effect and deteriorating jobs publication-title: Appl Math Model doi: 10.1016/j.apm.2013.04.008 – volume: 56 start-page: 1452 year: 2009 end-page: 1463 ident: CR1 article-title: Hybrid flow shop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers publication-title: Comput Ind Eng doi: 10.1016/j.cie.2008.09.004 – volume: 50 start-page: 230 year: 1999 end-page: 243 ident: CR16 article-title: Sequencing with uncertain numerical data for make span minimization publication-title: J Oper Res Soc doi: 10.1057/palgrave.jors.2600690 – volume: 11 start-page: 4195 issue: 6 year: 2011 end-page: 4202 ident: CR26 article-title: A hybrid approach based on the genetic algorithm and neural network to design an incremental cellular manufacturing system publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2011.03.013 – volume: 218 start-page: 2069 year: 2011 end-page: 2073 ident: CR31 article-title: Scheduling with deteriorating jobs and learning effects publication-title: Appl Math Comput – volume: 93 start-page: 288 year: 1996 end-page: 299 ident: CR34 article-title: A neural network model for scheduling problems publication-title: Eur J Oper Res doi: 10.1016/0377-2217(96)00041-0 – volume: 38 start-page: 7609 year: 2011 end-page: 7615 ident: CR24 article-title: Solving flexible flow-shop problem with a hybrid genetic algorithm and data mining: a fuzzy approach publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2010.12.101 – volume: 222 start-page: 519 issue: 4 year: 2008 end-page: 539 ident: CR11 article-title: A novel multi-objective particle swarm optimization algorithm for no-wait flow shop scheduling problems publication-title: Proc Inst Mech Eng Part B J Eng Manuf doi: 10.1243/09544054JEM989 – volume: 26 start-page: 67 year: 1997 end-page: 86 ident: CR15 article-title: Optimal make span scheduling with given bounds of processing times publication-title: Math Comput Model – volume: 38 start-page: 1364 year: 2011 end-page: 1373 ident: CR50 article-title: An integrated data envelopment analysis-artificial neural network-rough set algorithm for assessment of personnel efficiency publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2010.07.033 – volume: 33 start-page: 3848 year: 2009 end-page: 3853 ident: CR30 article-title: Learning effect and deteriorating jobs in the single machine scheduling problems publication-title: Appl Math Model doi: 10.1016/j.apm.2009.01.004 – volume: 47 start-page: 259 issue: 3 year: 2000 end-page: 268 ident: CR2 article-title: Asymptotically optimal linear time algorithms for two-stage and three-stage flexible flow shops publication-title: Nav Res Logist (NRL) doi: 10.1002/(SICI)1520-6750(200004)47:3<259::AID-NAV5>3.0.CO;2-K – volume: 132 start-page: 528 year: 2001 end-page: 538 ident: CR9 article-title: A flexible flow shop problem with total flow time minimization publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(00)00142-9 – volume: 7 start-page: 569 issue: 2 year: 2007 end-page: 576 ident: CR49 article-title: A hybrid approach based on neural networks and genetic algorithms for detecting temporal patterns in stock markets publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2006.03.004 – volume: 44 start-page: 73 year: 2006 end-page: 84 ident: CR6 article-title: Scheduling a two-stage flowshop under makespan constraint publication-title: Math Comput Model doi: 10.1016/j.mcm.2004.12.016 – volume: 23 start-page: 765 year: 2010 end-page: 771 ident: CR13 article-title: A meta-heuristic approach to solve a JIT scheduling problem in hybrid publication-title: Eng Appl Artif Intell doi: 10.1016/j.engappai.2010.01.008 – volume: 79 start-page: 135 year: 2015 end-page: 145 ident: CR25 article-title: A hybrid computer simulation-adaptive neuro-fuzzy inference system algorithm for optimization of dispatching rule selection in job shop scheduling problems under uncertainty publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-015-6795-x – volume: 37 start-page: 827 issue: 12 year: 2006 end-page: 833 ident: CR45 article-title: A note on scheduling problems with learning effect and deteriorating jobs publication-title: Int J Syst Sci doi: 10.1080/00207720600879260 – volume: 10 start-page: 65 year: 2003 end-page: 76 ident: CR17 article-title: Two-machine flow shop minimum length scheduling problem with random and bounded processing times publication-title: Int Trans Oper Res doi: 10.1111/1475-3995.00393 – volume: 145 start-page: 88 year: 2013 end-page: 95 ident: CR20 article-title: A metaheuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2012.09.014 – volume: 103 start-page: 386 year: 2006 end-page: 400 ident: CR19 article-title: Two-machine flow shop scheduling problem to minimize total completion time with bounded setup and processing times publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2005.10.002 – volume: 50 start-page: 1629 year: 2005 end-page: 1638 ident: CR41 article-title: Complexity and algorithms for two-stage flexible flow shop scheduling with availability constraints publication-title: Comput Math Appl doi: 10.1016/j.camwa.2005.07.008 – volume: 51 start-page: 3501 issue: 12 year: 2013 end-page: 3515 ident: CR7 article-title: Hybrid firefly-simulated annealing algorithm for the flow shop problem with learning effects and flexible maintenance activities publication-title: Int J Prod Res doi: 10.1080/00207543.2012.750771 – volume: 11 start-page: 614 issue: 1 year: 2011 end-page: 620 ident: CR48 article-title: A meta-heuristic framework for forecasting household electricity consumption publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2009.12.021 – volume: 151 start-page: 415 year: 2003 end-page: 433 ident: CR27 article-title: A contribution to the stochastic flow shop scheduling problem publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(02)00835-4 – volume: 38 start-page: 5231 year: 2014 end-page: 5238 ident: CR33 article-title: Scheduling deteriorating jobs with a learning effect on unrelated parallel machines publication-title: Appl Math Model doi: 10.1016/j.apm.2014.04.002 – volume: 180 start-page: 111 year: 2006 end-page: 127 ident: CR28 article-title: An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times publication-title: Appl Math Comput – volume: 19 start-page: 269 year: 2011 end-page: 281 ident: CR37 article-title: A neuro-fuzzy-regression algorithm for improved prediction of manufacturing lead time with machine breakdowns publication-title: Concur Eng Res Appl doi: 10.1177/1063293X11424512 – volume: 35 start-page: 1107 year: 2011 end-page: 1123 ident: CR40 article-title: Hybrid flowshop scheduling with machine and resource-dependent processing times publication-title: Appl Math Model doi: 10.1016/j.apm.2010.07.057 – volume: 52 start-page: 708 year: 2001 end-page: 717 ident: CR5 article-title: NP-hard cases in scheduling deteriorating jobs on dedicated machines publication-title: J Oper Res Soc doi: 10.1057/palgrave.jors.2601117 – volume: 58 start-page: 25 issue: 1 year: 2010 end-page: 28 ident: CR46 article-title: Some scheduling problems with deteriorating jobs and learning effects publication-title: Comput Ind Eng doi: 10.1016/j.cie.2009.06.016 – volume: 50 start-page: 7401 issue: 24 year: 2012 end-page: 7414 ident: CR4 article-title: Machine scheduling in the presence of sequence-dependent setup times and a rate-modifying activity publication-title: Int J Prod Res doi: 10.1080/00207543.2011.649801 – volume: 37 start-page: 83 year: 2010 end-page: 90 ident: CR8 article-title: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs publication-title: Comput Oper Res doi: 10.1016/j.cor.2009.03.019 – volume: 128 start-page: 144 year: 2010 end-page: 152 ident: CR51 article-title: A hybrid genetic algorithm for no-wait flow shop scheduling problem publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2010.06.006 – volume: 17 start-page: 257 year: 2009 end-page: 266 ident: CR36 article-title: The minimum-cost PD process planning and control methodology with the consideration of resource/time constraints and skill levels publication-title: Concur Eng Res Appl doi: 10.1177/1063293X09352121 – year: 2015 ident: CR54 article-title: Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms publication-title: J Intell Manuf doi: 10.1007/s10845-015-1084-y – volume: 23 start-page: 595 year: 1999 end-page: 609 ident: CR23 article-title: A framework for schedule evaluation with processing uncertainty publication-title: Comput Chem Eng doi: 10.1016/S0098-1354(98)00296-8 – volume: 29 start-page: 123 year: 2002 end-page: 149 ident: CR53 article-title: Local search heuristics for two-stage flow shop problems with secondary criterion publication-title: Comput Oper Res doi: 10.1016/S0305-0548(00)00061-7 – volume: 43 start-page: 157 year: 2014 end-page: 168 ident: CR21 article-title: A holonic approach to flexible flow shop scheduling under stochastic processing times publication-title: Comput Oper Res doi: 10.1016/j.cor.2013.09.013 – year: 1999 ident: CR47 publication-title: Simulation with visual Slam and AweSim – volume: 38 start-page: 495 year: 1990 end-page: 498 ident: CR29 article-title: Scheduling deteriorating jobs on a single processor publication-title: Oper Res doi: 10.1287/opre.38.3.495 – volume: 230 start-page: 934 year: 2015 end-page: 953 ident: CR38 article-title: Simulated imperialist competitive algorithm in two-stage assembly flow shop with machine breakdowns and preventive maintenance publication-title: Proc Inst Mech Eng Part B J Eng Manuf doi: 10.1177/0954405414563554 – volume: 49 start-page: 991 year: 2009 end-page: 1011 ident: CR18 article-title: Schedule execution for two-machine flow-shop with interval processing times publication-title: Math Comput Model doi: 10.1016/j.mcm.2008.02.004 – volume: 56 start-page: 142 year: 2009 end-page: 151 ident: CR39 article-title: 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 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2008.04.008 – volume: 5092 start-page: 651 year: 2008 end-page: 660 ident: CR42 article-title: A two-stage flexible flow shop problem with deterioration publication-title: Comput Comb Lect Notes Comput Sci – volume: 26 start-page: 303 year: 2015 end-page: 314 ident: CR52 article-title: Performance evaluation of approximated artificial neural network (AANN) algorithm for reliability improvement publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2014.10.002 – year: 1997 ident: CR55 publication-title: Industrial scheduling – volume: 183 start-page: 634 year: 2006 end-page: 645 ident: CR12 article-title: Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case publication-title: Appl Math Comput – volume: 159 start-page: 66 year: 2004 end-page: 82 ident: CR43 article-title: Scheduling flexible flow lines with sequence-dependent setup times publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(03)00401-6 – volume: 36 start-page: 10295 year: 2009 end-page: 10303 ident: CR14 article-title: A single-machine bi-criterion learning scheduling problem with release times publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2009.01.047 – volume: 25 start-page: 494 year: 2012 end-page: 506 ident: CR22 article-title: Study of stochastic sequence-dependent flexible flow shop via developing a dispatching rule and a hybrid GA publication-title: Eng Appl Artif Intell doi: 10.1016/j.engappai.2011.12.004 – volume: 37 start-page: 354 year: 2008 end-page: 370 ident: CR3 article-title: Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-007-0977-0 – volume: 23 start-page: 595 year: 1999 ident: 3368_CR23 publication-title: Comput Chem Eng doi: 10.1016/S0098-1354(98)00296-8 – volume: 38 start-page: 7609 year: 2011 ident: 3368_CR24 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2010.12.101 – volume-title: Simulation with visual Slam and AweSim year: 1999 ident: 3368_CR47 – volume: 44 start-page: 73 year: 2006 ident: 3368_CR6 publication-title: Math Comput Model doi: 10.1016/j.mcm.2004.12.016 – volume: 11 start-page: 614 issue: 1 year: 2011 ident: 3368_CR48 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2009.12.021 – volume: 3 start-page: 83 year: 2004 ident: 3368_CR44 publication-title: Int J Bus Econ – volume: 222 start-page: 519 issue: 4 year: 2008 ident: 3368_CR11 publication-title: Proc Inst Mech Eng Part B J Eng Manuf doi: 10.1243/09544054JEM989 – volume: 38 start-page: 495 year: 1990 ident: 3368_CR29 publication-title: Oper Res doi: 10.1287/opre.38.3.495 – volume: 25 start-page: 494 year: 2012 ident: 3368_CR22 publication-title: Eng Appl Artif Intell doi: 10.1016/j.engappai.2011.12.004 – volume: 180 start-page: 111 year: 2006 ident: 3368_CR28 publication-title: Appl Math Comput doi: 10.1016/j.amc.2005.11.136 – volume: 5092 start-page: 651 year: 2008 ident: 3368_CR42 publication-title: Comput Comb Lect Notes Comput Sci – volume: 230 start-page: 934 year: 2015 ident: 3368_CR38 publication-title: Proc Inst Mech Eng Part B J Eng Manuf doi: 10.1177/0954405414563554 – volume: 7 start-page: 569 issue: 2 year: 2007 ident: 3368_CR49 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2006.03.004 – volume: 29 start-page: 123 year: 2002 ident: 3368_CR53 publication-title: Comput Oper Res doi: 10.1016/S0305-0548(00)00061-7 – volume: 33 start-page: 3848 year: 2009 ident: 3368_CR30 publication-title: Appl Math Model doi: 10.1016/j.apm.2009.01.004 – volume: 159 start-page: 66 year: 2004 ident: 3368_CR43 publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(03)00401-6 – volume: 58 start-page: 25 issue: 1 year: 2010 ident: 3368_CR46 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2009.06.016 – volume: 79 start-page: 135 year: 2015 ident: 3368_CR25 publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-015-6795-x – volume: 103 start-page: 386 year: 2006 ident: 3368_CR19 publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2005.10.002 – year: 2015 ident: 3368_CR54 publication-title: J Intell Manuf doi: 10.1007/s10845-015-1084-y – volume: 56 start-page: 142 year: 2009 ident: 3368_CR39 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2008.04.008 – volume: 26 start-page: 303 year: 2015 ident: 3368_CR52 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2014.10.002 – volume: 151 start-page: 415 year: 2003 ident: 3368_CR27 publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(02)00835-4 – volume: 43 start-page: 157 year: 2014 ident: 3368_CR21 publication-title: Comput Oper Res doi: 10.1016/j.cor.2013.09.013 – volume: 56 start-page: 1452 year: 2009 ident: 3368_CR1 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2008.09.004 – volume: 183 start-page: 634 year: 2006 ident: 3368_CR12 publication-title: Appl Math Comput doi: 10.1016/j.amc.2006.05.106 – volume: 37 start-page: 354 year: 2008 ident: 3368_CR3 publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-007-0977-0 – volume: 49 start-page: 991 year: 2009 ident: 3368_CR18 publication-title: Math Comput Model doi: 10.1016/j.mcm.2008.02.004 – volume-title: Industrial scheduling year: 1997 ident: 3368_CR55 – volume: 38 start-page: 1364 year: 2011 ident: 3368_CR50 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2010.07.033 – volume: 36 start-page: 10295 year: 2009 ident: 3368_CR14 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2009.01.047 – volume: 46 start-page: 679 year: 2004 ident: 3368_CR35 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2004.05.005 – volume: 11 start-page: 4195 issue: 6 year: 2011 ident: 3368_CR26 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2011.03.013 – volume: 52 start-page: 708 year: 2001 ident: 3368_CR5 publication-title: J Oper Res Soc doi: 10.1057/palgrave.jors.2601117 – volume: 93 start-page: 288 year: 1996 ident: 3368_CR34 publication-title: Eur J Oper Res doi: 10.1016/0377-2217(96)00041-0 – volume: 50 start-page: 7401 issue: 24 year: 2012 ident: 3368_CR4 publication-title: Int J Prod Res doi: 10.1080/00207543.2011.649801 – volume: 37 start-page: 83 year: 2010 ident: 3368_CR8 publication-title: Comput Oper Res doi: 10.1016/j.cor.2009.03.019 – volume: 50 start-page: 230 year: 1999 ident: 3368_CR16 publication-title: J Oper Res Soc doi: 10.1057/palgrave.jors.2600690 – volume: 37 start-page: 8865 year: 2013 ident: 3368_CR32 publication-title: Appl Math Model doi: 10.1016/j.apm.2013.04.008 – volume: 10 start-page: 65 year: 2003 ident: 3368_CR17 publication-title: Int Trans Oper Res doi: 10.1111/1475-3995.00393 – volume: 17 start-page: 257 year: 2009 ident: 3368_CR36 publication-title: Concur Eng Res Appl doi: 10.1177/1063293X09352121 – volume: 47 start-page: 259 issue: 3 year: 2000 ident: 3368_CR2 publication-title: Nav Res Logist (NRL) doi: 10.1002/(SICI)1520-6750(200004)47:3<259::AID-NAV5>3.0.CO;2-K – volume: 51 start-page: 3501 issue: 12 year: 2013 ident: 3368_CR7 publication-title: Int J Prod Res doi: 10.1080/00207543.2012.750771 – volume: 128 start-page: 144 year: 2010 ident: 3368_CR51 publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2010.06.006 – volume: 37 start-page: 827 issue: 12 year: 2006 ident: 3368_CR45 publication-title: Int J Syst Sci doi: 10.1080/00207720600879260 – volume: 26 start-page: 67 year: 1997 ident: 3368_CR15 publication-title: Math Comput Model – volume: 145 start-page: 88 year: 2013 ident: 3368_CR20 publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2012.09.014 – volume: 33 start-page: 609 year: 2005 ident: 3368_CR10 publication-title: Oper Res Lett doi: 10.1016/j.orl.2004.10.004 – volume: 35 start-page: 1107 year: 2011 ident: 3368_CR40 publication-title: Appl Math Model doi: 10.1016/j.apm.2010.07.057 – volume: 218 start-page: 2069 year: 2011 ident: 3368_CR31 publication-title: Appl Math Comput doi: 10.1016/j.amc.2011.07.023 – volume: 23 start-page: 765 year: 2010 ident: 3368_CR13 publication-title: Eng Appl Artif Intell doi: 10.1016/j.engappai.2010.01.008 – volume: 38 start-page: 5231 year: 2014 ident: 3368_CR33 publication-title: Appl Math Model doi: 10.1016/j.apm.2014.04.002 – volume: 132 start-page: 528 year: 2001 ident: 3368_CR9 publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(00)00142-9 – volume: 19 start-page: 269 year: 2011 ident: 3368_CR37 publication-title: Concur Eng Res Appl doi: 10.1177/1063293X11424512 – volume: 50 start-page: 1629 year: 2005 ident: 3368_CR41 publication-title: Comput Math Appl doi: 10.1016/j.camwa.2005.07.008  | 
    
| SSID | ssj0004685 | 
    
| Score | 2.3129776 | 
    
| Snippet | This study presents an integrated approach based on artificial neural network (ANN), genetic algorithm (GA) and computer simulation to explore all the solution... | 
    
| SourceID | proquest crossref springer  | 
    
| SourceType | Aggregation Database Enrichment Source Index Database Publisher  | 
    
| StartPage | 5327 | 
    
| SubjectTerms | Artificial Intelligence Artificial neural networks Computational Biology/Bioinformatics Computational Science and Engineering Computer Science Computer simulation Data Mining and Knowledge Discovery Deterioration Genetic algorithms Image Processing and Computer Vision Integrated approach Learning theory Neural networks Optimization Original Article Probability and Statistics in Computer Science Production scheduling Sequences Sequential scheduling Setup times Solution space  | 
    
| SummonAdditionalLinks | – databaseName: SpringerLink Journals (ICM) dbid: U2A link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTsMwELWgbNjwRxQKmgUrwFISJ46zrBAIIcGKSuyi-FMoKklFgthyBy7A2TgJ49QuHwESuyhxZpGZeJ7tmfcI2Q9THhRchjTLTEbjYcppprWgKjNM8JQpo-yG_sUlPxvE59fJtevjrn21uz-SbGfqWbOb3cG0S19BGeOC8nmykFg2LwziQdT_1AzZ6nDissWW9MTMH2X-ZOJrMvpAmN8ORdtcc7pClhxIhP7Uq6tkzpRrZNkLMID7H9fJa78E03JAYOqAenTvtLjenl8sTyWaKKdV3ngDA8X2K0IxvqkeRs3tPSBchaHlw5RjgxfVE9S31aQGuzULvsSaepVctG-axwm0YvRHcFdJ0LaUZuRiCIpSg9OguAFXJrJBBqcnV8dn1EkuUMV41tAQ07UpEDRxXOroQJnUsDhNhZJBLIshG1q9dZwSIpUmvNAC0ZSKOUKMIFGRxiy4STplVZotAkLqKFCh1goxToEThWWCTwspEXMIocIuCfy3z5XjI7eyGON8xqTcuitHd-XWXTnvkoPZK5MpGcdfg3veobn7L-s8iiweYwnPuuTQO_nj8a_Gtv81eocsIq5ypWg90mkeHs0uYpdG7rWx-g7bLOmW priority: 102 providerName: Springer Nature  | 
    
| Title | An efficient simulation–neural network–genetic algorithm for flexible flow shops with sequence-dependent setup times, job deterioration and learning effects | 
    
| URI | https://link.springer.com/article/10.1007/s00521-018-3368-6 https://www.proquest.com/docview/2299373569  | 
    
| Volume | 31 | 
    
| hasFullText | 1 | 
    
| inHoldings | 1 | 
    
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: EBSCOhost Academic Search Ultimate customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn eissn: 1433-3058 dateEnd: 20241102 omitProxy: true ssIdentifier: ssj0004685 issn: 0941-0643 databaseCode: ABDBF dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn providerName: EBSCOhost – providerCode: PRVEBS databaseName: Inspec with Full Text customDbUrl: eissn: 1433-3058 dateEnd: 20241102 omitProxy: false ssIdentifier: ssj0004685 issn: 0941-0643 databaseCode: ADMLS dateStart: 19930301 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text providerName: EBSCOhost – providerCode: PRVLSH databaseName: SpringerLink Journals customDbUrl: mediaType: online eissn: 1433-3058 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004685 issn: 0941-0643 databaseCode: AFBBN dateStart: 19970301 isFulltext: true providerName: Library Specific Holdings – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 1433-3058 dateEnd: 20241102 omitProxy: true ssIdentifier: ssj0004685 issn: 0941-0643 databaseCode: BENPR dateStart: 20120101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Technology Collection customDbUrl: eissn: 1433-3058 dateEnd: 20241102 omitProxy: true ssIdentifier: ssj0004685 issn: 0941-0643 databaseCode: 8FG dateStart: 20180401 isFulltext: true titleUrlDefault: https://search.proquest.com/technologycollection1 providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK - Czech Republic Consortium customDbUrl: eissn: 1433-3058 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004685 issn: 0941-0643 databaseCode: AGYKE dateStart: 19970101 isFulltext: true titleUrlDefault: http://link.springer.com providerName: Springer Nature – providerCode: PRVAVX databaseName: SpringerLink Journals (ICM) customDbUrl: eissn: 1433-3058 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0004685 issn: 0941-0643 databaseCode: U2A dateStart: 19970101 isFulltext: true titleUrlDefault: http://www.springerlink.com/journals/ providerName: Springer Nature  | 
    
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3NbtNAEB61yYULlD8RKNEcOAErbK-zXh8QSqukFYgIISKVk7V_aYtSOxBXXPsOvADPxpMw6-w2gERv1tpeyZ7ZmW93Z78P4FlaiEQJnbKydCXLF4VgpbWSmdJxKQpunPEL-u9n4nievz0ZnezALJ6F8WWVMSZ2gdo2xq-Rv8oyn0n5SJRvVl-ZV43yu6tRQkMFaQX7uqMY24V-5pmxetA_mMw-fPzjpGQn0klzGl_vk_O4z5l0tKKUymhqLRnnQjLxd6baws9_dky7RDTdg9sBQeJ4Y_K7sOPqe3AnqjNgGKz34ee4RtcRRFBewfX5RRDq-nX1w5NYUhf1pgScGsiL_GFGVMtT-ub27AIJy-LCk2XqpaOL5juuz5rVGv26Lcb6axYldKl_116usFOqf4lfGo3W19mcBwdDVVsMAhWnGGpIHsB8Ovl0eMyCHgMzXJQtSymXO0WIStA8yCbGFY7nRSGNTnKtFnzhxdgpXmSmGAllJUEtkwvCH8nIZJZS5EPo1U3tHgFKbbPEpNYaAkCKooiniS-U1gRIpDTpAJL47ysTyMq9ZsayuqZZ7sxVkbkqb65KDOD59SurDVPHTQ_vR4NWYdCuq62LDeBFNPL29n87e3xzZ0_gFqGsUJi2D73226V7Skim1UPYldOjIfTHR5_fTYbBWal1no1_Ax4Z9xU | 
    
| linkProvider | ProQuest | 
    
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NbtQwELaq9gAX_hELBeYAF8AiibOOc6hQgVZb2q4QaqXegv-2LdomC0lVceMdeAGehIfhSZjJ2l1Aorfeovz4kBnPfLZnvo-xJ2khEy1NysvSlzyfFJKXziluSy-ULIT1ljb0d8dytJ-_OxgeLLGfsReGyipjTOwDtWss7ZG_zDLKpGIoy1ezz5xUo-h0NUpo6CCt4NZ6irHQ2LHtv57hEq5d23qL9n6aZZsbe29GPKgMcCtk2fEUM5TXiBMkonuXWF94kReFsibJjZ6ICUmM4yzIbDGU2ikEEDaXmFWToc1cSsQHmAJWcpGXuPhbeb0xfv_hj87MXhQU11BUX5SLeK6a9DSmmDpxKa-4EFJx-XdmXMDdf05o-8S3eYNdC4gV1ucudpMt-foWux7VICAEh9vsx3oNviekwDwG7fFJEAb79e07kWbiEPW85BxvoNdS8yTo6SH-4-7oBBA7w4TIOc3U40VzBu1RM2uB9okh1nvzKNmL4_vudAYdNbC8gE-NAUd1PcfBoUHXDoIgxiGEmpU7bP9SLHOXLddN7e8xUMZliU2dswi4NEYtoqUvtDEIgJSy6YAl8d9XNpCjk0bHtDqnde7NVaG5KjJXJQfs2fknszkzyEUvr0aDViFItNXCpQfseTTy4vF_B7t_8WCP2ZXR3u5OtbM13n7AriLCC0Vxq2y5-3LqHyKK6syj4KrAPl727PgNzUguFQ | 
    
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LTtwwFLUoSKgbWl5iWgp3wQqwSOKM4yxHtCPeYsFI7KL4kWHQkIxIULf9h_5Av61fwnXGHh6CSt1FiXOl5F7bx_a95xCyEyY8yLkMaZqalMZFwmmqtaAqNUzwhCmj7Ib--QU_GsQn191rp3Na-2x3fyQ5rWmwLE1lczDRxcGs8M3uZtplsKCMcUH5B7IQW54EDOhB1HtWGNlqcuISxqb3xMwfa75l4uXE9IQ2Xx2QtvNO_zNZcoARelMPL5M5U66QT16MAVzfXCV_eiWYlg8CPwPq0Z3T5fr767flrEQT5TTjG29g0NjaRcjHw-p-1NzcAUJXKCw3phwbvKh-Qn1TTWqw27Tg062pV8xF-6Z5mEArTL8Pt5UEbdNqRi6eIC81OD2KIbiUkTUy6P-4OjyiTn6BKsbThoY4dZscARTHZY8OlEkMi5NEKBnEMi9YYbXXcXiIVNLluRaIrFTMEW4EXRVpnBHXyXxZlWaDgJA6ClSotUK8k-OgYVnhk1xKxB9CqLBDAv_vM-W4ya1ExjibsSq37srQXZl1V8Y7ZHf2ymRKzPGvxpveoZnro3UWRRabsS5PO2TPO_np8bvGvvxX622yePm9n50dX5x-JR8RbrkMtU0y39w_mG8IaRq51YbtI13m8L4 | 
    
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+efficient+simulation%E2%80%93neural+network%E2%80%93genetic+algorithm+for+flexible+flow+shops+with+sequence-dependent+setup+times%2C+job+deterioration+and+learning+effects&rft.jtitle=Neural+computing+%26+applications&rft.au=Azadeh%2C+A&rft.au=A+Hasani+Goodarzi&rft.au=Kolaee%2C+M+Hasannia&rft.au=Jebreili%2C+S&rft.date=2019-09-01&rft.pub=Springer+Nature+B.V&rft.issn=0941-0643&rft.eissn=1433-3058&rft.volume=31&rft.issue=9&rft.spage=5327&rft.epage=5341&rft_id=info:doi/10.1007%2Fs00521-018-3368-6 | 
    
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0941-0643&client=summon | 
    
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0941-0643&client=summon | 
    
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0941-0643&client=summon |