A novel discrete water wave optimization algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times
This paper considers n-job m-machines blocking flow-shop scheduling problem (BFSP) with sequence-dependent setup times (SDST), which has important ramifications in the modern industry. To solve this problem, two efficient heuristics are firstly presented according to the property of the problem. The...
Saved in:
| Published in | Swarm and evolutionary computation Vol. 40; pp. 53 - 75 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
01.06.2018
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 2210-6502 |
| DOI | 10.1016/j.swevo.2017.12.005 |
Cover
| Abstract | This paper considers n-job m-machines blocking flow-shop scheduling problem (BFSP) with sequence-dependent setup times (SDST), which has important ramifications in the modern industry. To solve this problem, two efficient heuristics are firstly presented according to the property of the problem. Then, a novel discrete water wave optimization (DWWO) algorithm is proposed. In the proposed DWWO, an initial population with high quality and diversity is constructed based on the presented heuristic and a perturbation procedure. A two-stage propagation is designed to direct the algorithm towards the good solutions. The path relinking technique is employed in refraction phase to help individuals escape from local optima. A variable neighborhood search is developed and embedded in breaking phase to enhance local exploitation capability. A new population updating scheme is applied to accelerate the convergence speed. Moreover, a speedup method is presented to reduce the computational efforts needed for evaluating insertion neighborhood. Finally, extensive numerical tests are carried out, and the results compared to some state-of-the-art metaheuristics demonstrate the effectiveness of the proposed DWWO in solving BFSP with SDST.
•Two new heuristics are presented for BFSP/SDST.•An attempt is made to solve the NP-hard type combinatorial problems by using wave water optimization algorithm.•A speedup method is designed for evaluating insertion neighborhood structure.•Computational and statistical analyses show the superiority of the presented approaches. |
|---|---|
| AbstractList | This paper considers n-job m-machines blocking flow-shop scheduling problem (BFSP) with sequence-dependent setup times (SDST), which has important ramifications in the modern industry. To solve this problem, two efficient heuristics are firstly presented according to the property of the problem. Then, a novel discrete water wave optimization (DWWO) algorithm is proposed. In the proposed DWWO, an initial population with high quality and diversity is constructed based on the presented heuristic and a perturbation procedure. A two-stage propagation is designed to direct the algorithm towards the good solutions. The path relinking technique is employed in refraction phase to help individuals escape from local optima. A variable neighborhood search is developed and embedded in breaking phase to enhance local exploitation capability. A new population updating scheme is applied to accelerate the convergence speed. Moreover, a speedup method is presented to reduce the computational efforts needed for evaluating insertion neighborhood. Finally, extensive numerical tests are carried out, and the results compared to some state-of-the-art metaheuristics demonstrate the effectiveness of the proposed DWWO in solving BFSP with SDST.
•Two new heuristics are presented for BFSP/SDST.•An attempt is made to solve the NP-hard type combinatorial problems by using wave water optimization algorithm.•A speedup method is designed for evaluating insertion neighborhood structure.•Computational and statistical analyses show the superiority of the presented approaches. |
| Author | Shao, Zhongshi Shao, Weishi Pi, Dechang |
| Author_xml | – sequence: 1 givenname: Zhongshi surname: Shao fullname: Shao, Zhongshi email: shaozhongshi@hotmail.com organization: College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China – sequence: 2 givenname: Dechang surname: Pi fullname: Pi, Dechang email: nuaacs@126.com organization: College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China – sequence: 3 givenname: Weishi surname: Shao fullname: Shao, Weishi email: shaoweishi@hotmail.com organization: College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China |
| BookMark | eNqFkD1PwzAQhj0UiVL6C1j8BxJsp_kaGKqKL6kSC8yWY19alyQOtpsIJn46TmFigBvupFf3nHTPBZp1pgOEriiJKaHZ9SF2IwwmZoTmMWUxIekMzRmjJMpSws7R0rkDCZURlqblHH2ucWcGaLDSTlrwgEfhwYY-ADa9163-EF6bDotmZ6z2-xbXxuKqMfJVdztcN2aM3N702Mk9qGMzhb01VQMtHsM-dvB2hE5CpKCHTkHnQ-SPPQ7HwV2is1o0DpY_c4Fe7m6fNw_R9un-cbPeRjIhiY9EmqpKspwxxSgkZVooRlSZr4BkdSpWtAhdJDkrZa1ykhQiYaTIVFVXYazqZIGS77vSGucs1Ly3uhX2nVPCJ3f8wE_u-OSOU8aDu0CVvyip_cmHt0I3_7A33yyEtwYNljupJxFKW5CeK6P_5L8AdVKT1g |
| CitedBy_id | crossref_primary_10_1016_j_asoc_2021_107229 crossref_primary_10_1109_ACCESS_2024_3372396 crossref_primary_10_1016_j_engappai_2021_104264 crossref_primary_10_3390_math10193446 crossref_primary_10_1016_j_eswa_2018_06_020 crossref_primary_10_1016_j_eswa_2019_06_069 crossref_primary_10_1080_00207543_2019_1642529 crossref_primary_10_1016_j_eswa_2022_116921 crossref_primary_10_1016_j_swevo_2023_101399 crossref_primary_10_1016_j_swevo_2020_100747 crossref_primary_10_1016_j_matcom_2020_09_019 crossref_primary_10_23919_CSMS_2021_0010 crossref_primary_10_1016_j_asoc_2020_106343 crossref_primary_10_1016_j_swevo_2020_100664 crossref_primary_10_2139_ssrn_4053288 crossref_primary_10_1016_j_asoc_2021_107834 crossref_primary_10_1016_j_eswa_2021_115535 crossref_primary_10_1016_j_eswa_2019_113166 crossref_primary_10_1109_TII_2022_3218645 crossref_primary_10_1080_00207543_2021_1942284 crossref_primary_10_1016_j_cie_2023_109082 crossref_primary_10_2139_ssrn_4061447 crossref_primary_10_1016_j_eswa_2022_117602 crossref_primary_10_1080_00207543_2022_2127959 crossref_primary_10_1016_j_simpat_2021_102455 crossref_primary_10_1007_s00521_019_04527_9 crossref_primary_10_1016_j_cie_2023_109760 crossref_primary_10_1080_0305215X_2018_1542693 crossref_primary_10_1080_09540091_2019_1674247 crossref_primary_10_1155_2020_7132469 crossref_primary_10_3389_fpls_2023_1139094 crossref_primary_10_1016_j_jksues_2021_02_015 crossref_primary_10_1016_j_knosys_2022_108471 crossref_primary_10_1016_j_cor_2019_04_024 crossref_primary_10_1088_1742_6596_1950_1_012054 crossref_primary_10_1007_s10479_019_03490_x crossref_primary_10_1016_j_eswa_2020_113462 crossref_primary_10_1016_j_knosys_2018_11_021 crossref_primary_10_1016_j_engappai_2018_11_005 crossref_primary_10_1007_s10951_019_00610_0 crossref_primary_10_1016_j_asoc_2019_105611 crossref_primary_10_1016_j_knosys_2021_107874 crossref_primary_10_1016_j_eswa_2020_113837 crossref_primary_10_1016_j_engappai_2022_105443 crossref_primary_10_1016_j_swevo_2019_100561 crossref_primary_10_1007_s10489_022_03236_6 crossref_primary_10_1109_ACCESS_2019_2930281 crossref_primary_10_1016_j_asoc_2022_109980 crossref_primary_10_3233_JIFS_201522 crossref_primary_10_1016_j_cor_2019_07_013 |
| Cites_doi | 10.1016/j.eswa.2017.09.028 10.1080/00207543.2016.1177671 10.1016/j.cor.2013.01.005 10.1016/j.ejor.2017.06.027 10.1016/0377-2217(90)90090-X 10.1016/j.asoc.2011.09.021 10.1007/s00170-010-3111-7 10.1016/j.eswa.2017.01.006 10.1016/j.cor.2013.09.014 10.1016/j.cie.2016.05.005 10.1016/j.cor.2016.07.002 10.1007/s10100-011-0198-3 10.1016/j.cie.2017.07.037 10.1016/j.omega.2010.07.007 10.1016/j.eswa.2016.05.040 10.3390/a9040071 10.1016/j.cie.2015.04.013 10.1016/j.omega.2013.10.002 10.1016/S0925-5273(03)00065-3 10.1080/00207543.2013.802390 10.1016/j.compchemeng.2015.10.003 10.1287/opre.44.3.510 10.1016/j.cor.2008.12.004 10.1080/00207543.2015.1076941 10.1007/s00170-005-0093-y 10.1504/EJIE.2013.058392 10.1109/TASE.2012.2192729 10.1016/j.eswa.2010.04.042 10.1287/opre.37.6.925 10.1080/00207543.2016.1145821 10.1016/S0377-2217(96)00273-1 10.1016/j.omega.2009.04.002 10.1016/j.cor.2014.10.008 10.22266/ijies2016.1231.04 10.1080/00207543.2012.711968 10.1016/0305-0483(83)90088-9 10.1016/j.omega.2011.06.002 10.1016/j.swevo.2011.02.002 10.1080/0305215X.2014.928817 10.1007/s10732-008-9080-4 10.1016/j.eswa.2015.03.026 10.1016/j.cor.2012.02.020 10.1016/S0167-5060(08)70356-X 10.1016/j.cor.2011.08.022 10.1016/S1004-9541(12)60588-6 10.1016/j.ejor.2004.08.046 10.1016/j.cie.2011.02.013 10.1016/j.cor.2009.08.001 10.1080/00207721.2012.723054 10.1109/TASE.2012.2219860 10.1016/j.engappai.2012.05.017 10.1016/j.ejor.2006.07.029 10.1016/j.omega.2007.01.003 10.1016/j.omega.2012.03.006 10.1016/j.ejor.2004.01.022 |
| ContentType | Journal Article |
| Copyright | 2017 Elsevier B.V. |
| Copyright_xml | – notice: 2017 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.swevo.2017.12.005 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EndPage | 75 |
| ExternalDocumentID | 10_1016_j_swevo_2017_12_005 S2210650217306259 |
| GroupedDBID | --K --M .~1 0R~ 1~. 1~5 4.4 457 4G. 5VS 7-5 8P~ AAAKF AABVA AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AATLK AAXUO AAYFN ABAOU ABBOA ABGRD ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADMUD ADQTV ADTZH AEBSH AECPX AEKER AENEX AEQOU AFKWA AFTJW AFXIZ AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BJAXD BKOJK BLXMC CBWCG EBS EFJIC EFLBG EJD FDB FEDTE FIRID FNPLU FYGXN GBLVA GBOLZ HAMUX HVGLF HZ~ J1W JJJVA KOM M41 MHUIS MO0 N9A O-L O9- OAUVE P-8 P-9 PC. Q38 RIG ROL SDF SES SPC SPCBC SSA SSB SSD SST SSV SSW SSZ T5K ~G- AATTM AAXKI AAYWO AAYXX ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c303t-a55dbc2722d21e3958d20d974e06f5a418f5aa3729cfd7038a32086dbfb0864f3 |
| IEDL.DBID | .~1 |
| ISSN | 2210-6502 |
| IngestDate | Thu Apr 24 23:10:31 EDT 2025 Wed Oct 01 04:16:47 EDT 2025 Fri Feb 23 02:26:28 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Metaheuristic Scheduling Flow shop with blocking Setup times Heuristic |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c303t-a55dbc2722d21e3958d20d974e06f5a418f5aa3729cfd7038a32086dbfb0864f3 |
| PageCount | 23 |
| ParticipantIDs | crossref_primary_10_1016_j_swevo_2017_12_005 crossref_citationtrail_10_1016_j_swevo_2017_12_005 elsevier_sciencedirect_doi_10_1016_j_swevo_2017_12_005 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | June 2018 2018-06-00 |
| PublicationDateYYYYMMDD | 2018-06-01 |
| PublicationDate_xml | – month: 06 year: 2018 text: June 2018 |
| PublicationDecade | 2010 |
| PublicationTitle | Swarm and evolutionary computation |
| PublicationYear | 2018 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Wang, Song, Gupta, Wu (bib11) 2012; 39 Taillard (bib48) 1990; 47 Deng, Xu, Gu (bib28) 2012; 20 Nagano, Komesu, Miyata (bib35) 2017 Wang, Pan, Tasgetiren (bib20) 2011; 61 Shao, Pi, Shao (bib34) 2017; 111 Nouri, Ladhari (bib38) 2017 Tasgetiren, Kizilay, Pan, Suganthan (bib18) 2017; 77 Nagano, Silva, Lorena (bib51) 2012; 25 Lin, Ying (bib9) 2013; 41 Tasgetiren, Pan, Kizilay, Suer (bib62) 2015 Wu, Liao, Wang (bib45) 2015 Davendra, BialicDavendra (bib23) 2013; 51 Graham, Lawler, Lenstra, Rinnooy Kan (bib46) 1979; 5 Ribas, Companys, Tort-Martorell (bib14) 2011; 39 Moslehi, Khorasanian (bib61) 2014; 52 Ronconi (bib59) 2004; 87 Deng, Gu (bib67) 2014; 45 Siva, Balamurugan, Lakshminarasimman (bib42) 2016; 9 Holm (bib69) 1979; 6 Ribas, Companys, Tort-Martorell (bib13) 2013; 7 Shao, Pi, Shao (bib25) 2017 Merchan, Maravelias (bib4) 2016; 84 Ruiz, Maroto, Alcaraz (bib57) 2005; 165 Zheng, Zhang (bib41) 2015 Pan, Gao, Li, Gao (bib54) 2017; 303 Zheng (bib40) 2015; 55 Tasgetiren, Pan, Kizilay, Gao (bib31) 2016; 9 Davendra, Zelinka, Bialic-Davendra, Senkerik, Jasek (bib21) 2012; 20 Yun, Feng, Lyu, Wang, Liu (bib44) 2016 Wang, Pan, Fatih Tasgetiren (bib26) 2010; 37 Rajendran, Ziegler (bib49) 1997; 103 Pan, Ruiz (bib47) 2014; 44 Ribas, Companys, Tort-Martorell (bib2) 2015; 42 Koren, Wang, Gu (bib5) 2017; 55 Montgomery (bib60) 2008 Sioud, Gagné (bib66) 2018; 264 Fernandez-Viagas, Leisten, Framinan (bib30) 2016; 61 Pan, Wang, Sang, Li, Liu (bib12) 2013; 10 Ribas, Companys (bib29) 2015; 87 Han, Gong, Li, Zhang (bib16) 2016; 54 Kilany, Hassanien, Badr (bib43) 2015 Gong, Tang, Duin (bib1) 2010; 37 Derrac, García, Molina, Herrera (bib71) 2011; 1 Ruiz, Stützle (bib64) 2008; 187 Nawaz, Enscore, Ham (bib50) 1983; 11 García, Molina, Lozano, Herrera (bib70) 2009; 15 Ding, Song, Gupta, Wang, Zhang, Wu (bib15) 2016; 54 Deng, Zhang, Zhao (bib37) 2016; 8 Han, Pan, Li, Sang (bib10) 2011; 60 Eddaly, Jarboui, Siarry (bib17) 2016; 3 Ribas, Companys, Tort-Martorell (bib36) 2017; 74 Gajpal, Rajendran, Ziegler (bib63) 2006; 30 Han, Gong, Sun (bib24) 2015; 47 Liang, Pan, Chen, Wang (bib19) 2011; 55 Zhao, Liu, Zhang, Ma, Zhang (bib68) 2018; 91 Kirlik, Oguz (bib56) 2012; 39 Martinez, Dauzère-Pérès, Guéret, Mati, Sauer (bib3) 2006; 169 Wang, Pan, Suganthan, Wang, Wang (bib7) 2010; 37 Mccormick, Pinedo, Shenker, Wolf (bib58) 1989; 37 Pan, Wang (bib8) 2012; 40 Tasgetiren, Pan, Suganthan, Buyukdagli (bib52) 2013; 40 Ronconi, Henriques (bib32) 2009; 37 Li, Zhang (bib65) 2012; 9 Wang, Tang (bib22) 2012; 12 Khorasanian, Moslehi (bib27) 2012; 23 Lin, Zhang (bib55) 2016; 97 Vallada, Ruiz (bib53) 2010; 38 Pinedo (bib39) 2015 Hall, Sriskandarajah (bib6) 1996; 44 Ribas, Companys, Tort-Martorell (bib33) 2013; 51 Derrac (10.1016/j.swevo.2017.12.005_bib71) 2011; 1 Li (10.1016/j.swevo.2017.12.005_bib65) 2012; 9 Yun (10.1016/j.swevo.2017.12.005_bib44) 2016 Gajpal (10.1016/j.swevo.2017.12.005_bib63) 2006; 30 Pan (10.1016/j.swevo.2017.12.005_bib12) 2013; 10 Lin (10.1016/j.swevo.2017.12.005_bib55) 2016; 97 Wang (10.1016/j.swevo.2017.12.005_bib26) 2010; 37 Nawaz (10.1016/j.swevo.2017.12.005_bib50) 1983; 11 Kirlik (10.1016/j.swevo.2017.12.005_bib56) 2012; 39 Montgomery (10.1016/j.swevo.2017.12.005_bib60) 2008 García (10.1016/j.swevo.2017.12.005_bib70) 2009; 15 Nagano (10.1016/j.swevo.2017.12.005_bib35) 2017 Nagano (10.1016/j.swevo.2017.12.005_bib51) 2012; 25 Tasgetiren (10.1016/j.swevo.2017.12.005_bib31) 2016; 9 Ribas (10.1016/j.swevo.2017.12.005_bib33) 2013; 51 Ribas (10.1016/j.swevo.2017.12.005_bib36) 2017; 74 Pinedo (10.1016/j.swevo.2017.12.005_bib39) 2015 Fernandez-Viagas (10.1016/j.swevo.2017.12.005_bib30) 2016; 61 Ruiz (10.1016/j.swevo.2017.12.005_bib64) 2008; 187 Vallada (10.1016/j.swevo.2017.12.005_bib53) 2010; 38 Tasgetiren (10.1016/j.swevo.2017.12.005_bib18) 2017; 77 Tasgetiren (10.1016/j.swevo.2017.12.005_bib52) 2013; 40 Holm (10.1016/j.swevo.2017.12.005_bib69) 1979; 6 Ding (10.1016/j.swevo.2017.12.005_bib15) 2016; 54 Ribas (10.1016/j.swevo.2017.12.005_bib14) 2011; 39 Nouri (10.1016/j.swevo.2017.12.005_bib38) 2017 Han (10.1016/j.swevo.2017.12.005_bib10) 2011; 60 Ribas (10.1016/j.swevo.2017.12.005_bib13) 2013; 7 Sioud (10.1016/j.swevo.2017.12.005_bib66) 2018; 264 Wang (10.1016/j.swevo.2017.12.005_bib11) 2012; 39 Zheng (10.1016/j.swevo.2017.12.005_bib41) 2015 Pan (10.1016/j.swevo.2017.12.005_bib47) 2014; 44 Rajendran (10.1016/j.swevo.2017.12.005_bib49) 1997; 103 Taillard (10.1016/j.swevo.2017.12.005_bib48) 1990; 47 Kilany (10.1016/j.swevo.2017.12.005_bib43) 2015 Merchan (10.1016/j.swevo.2017.12.005_bib4) 2016; 84 Gong (10.1016/j.swevo.2017.12.005_bib1) 2010; 37 Ronconi (10.1016/j.swevo.2017.12.005_bib32) 2009; 37 Davendra (10.1016/j.swevo.2017.12.005_bib21) 2012; 20 Pan (10.1016/j.swevo.2017.12.005_bib54) 2017; 303 Wang (10.1016/j.swevo.2017.12.005_bib22) 2012; 12 Mccormick (10.1016/j.swevo.2017.12.005_bib58) 1989; 37 Zhao (10.1016/j.swevo.2017.12.005_bib68) 2018; 91 Ribas (10.1016/j.swevo.2017.12.005_bib2) 2015; 42 Davendra (10.1016/j.swevo.2017.12.005_bib23) 2013; 51 Liang (10.1016/j.swevo.2017.12.005_bib19) 2011; 55 Han (10.1016/j.swevo.2017.12.005_bib16) 2016; 54 Koren (10.1016/j.swevo.2017.12.005_bib5) 2017; 55 Siva (10.1016/j.swevo.2017.12.005_bib42) 2016; 9 Deng (10.1016/j.swevo.2017.12.005_bib28) 2012; 20 Deng (10.1016/j.swevo.2017.12.005_bib37) 2016; 8 Wu (10.1016/j.swevo.2017.12.005_bib45) 2015 Wang (10.1016/j.swevo.2017.12.005_bib20) 2011; 61 Zheng (10.1016/j.swevo.2017.12.005_bib40) 2015; 55 Wang (10.1016/j.swevo.2017.12.005_bib7) 2010; 37 Shao (10.1016/j.swevo.2017.12.005_bib34) 2017; 111 Ruiz (10.1016/j.swevo.2017.12.005_bib57) 2005; 165 Moslehi (10.1016/j.swevo.2017.12.005_bib61) 2014; 52 Hall (10.1016/j.swevo.2017.12.005_bib6) 1996; 44 Shao (10.1016/j.swevo.2017.12.005_bib25) 2017 Martinez (10.1016/j.swevo.2017.12.005_bib3) 2006; 169 Khorasanian (10.1016/j.swevo.2017.12.005_bib27) 2012; 23 Pan (10.1016/j.swevo.2017.12.005_bib8) 2012; 40 Eddaly (10.1016/j.swevo.2017.12.005_bib17) 2016; 3 Han (10.1016/j.swevo.2017.12.005_bib24) 2015; 47 Ronconi (10.1016/j.swevo.2017.12.005_bib59) 2004; 87 Ribas (10.1016/j.swevo.2017.12.005_bib29) 2015; 87 Deng (10.1016/j.swevo.2017.12.005_bib67) 2014; 45 Tasgetiren (10.1016/j.swevo.2017.12.005_bib62) 2015 Graham (10.1016/j.swevo.2017.12.005_bib46) 1979; 5 Lin (10.1016/j.swevo.2017.12.005_bib9) 2013; 41 |
| References_xml | – volume: 37 start-page: 925 year: 1989 end-page: 935 ident: bib58 article-title: Sequencing in an assembly line with blocking to minimize cycle time publication-title: Oper. Res. – volume: 87 start-page: 30 year: 2015 end-page: 39 ident: bib29 article-title: Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization publication-title: Comput. Ind. Eng. – start-page: 137 year: 2015 end-page: 146 ident: bib45 article-title: Water wave optimization for the traveling salesman problem publication-title: Intelligent Computing Theories and Methodologies: 11th International Conference, ICIC 2015, Fuzhou, China, August 20-23, 2015, Proceedings, Part I. Cham – volume: 74 start-page: 41 year: 2017 end-page: 54 ident: bib36 article-title: Efficient heuristics for the parallel blocking flow shop scheduling problem publication-title: Expert Syst. Appl. – volume: 55 start-page: 1 year: 2015 end-page: 11 ident: bib40 article-title: Water wave optimization: a new nature-inspired metaheuristic publication-title: Comput. Oper. Res. – volume: 97 start-page: 128 year: 2016 end-page: 136 ident: bib55 article-title: An effective hybrid biogeography-based optimization algorithm for the distributed assembly permutation flow-shop scheduling problem publication-title: Comput. Ind. Eng. – volume: 52 start-page: 260 year: 2014 end-page: 268 ident: bib61 article-title: A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion publication-title: Comput. Oper. Res. – start-page: 175 year: 2015 end-page: 180 ident: bib43 article-title: Accelerometer-based human activity classification using Water Wave Optimization approach publication-title: 2015 11th International Computer Engineering Conference (ICENCO) – volume: 1 start-page: 3 year: 2011 end-page: 18 ident: bib71 article-title: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms publication-title: Swarm Evolut. Comput. – volume: 61 start-page: 76 year: 2011 end-page: 83 ident: bib20 article-title: A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem publication-title: Comput. Ind. Eng. – volume: 39 start-page: 1506 year: 2012 end-page: 1520 ident: bib56 article-title: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine publication-title: Comput. Oper. Res. – volume: 55 start-page: 1227 year: 2017 end-page: 1242 ident: bib5 article-title: Value creation through design for scalability of reconfigurable manufacturing systems publication-title: Int. J. Prod. Res. – volume: 264 start-page: 66 year: 2018 end-page: 73 ident: bib66 article-title: Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times publication-title: Eur. J. Oper. Res. – volume: 44 start-page: 510 year: 1996 end-page: 525 ident: bib6 article-title: A Survey of machine scheduling problems with blocking and No-Wait in process publication-title: Oper. Res. – volume: 20 start-page: 679 year: 2012 end-page: 717 ident: bib21 article-title: Clustered enhanced differential evolution for the blocking flow shop scheduling problem publication-title: Cent. Eur. J. Oper. Res. – volume: 6 start-page: 65 year: 1979 end-page: 70 ident: bib69 article-title: A simple sequentially rejective multiple test procedure publication-title: Scand. J. Stat. – volume: 87 start-page: 39 year: 2004 end-page: 48 ident: bib59 article-title: A note on constructive heuristics for the flowshop problem with blocking publication-title: Int. J. Prod. Econ. – volume: 37 start-page: 272 year: 2009 end-page: 281 ident: bib32 article-title: Some heuristic algorithms for total tardiness minimization in a flowshop with blocking publication-title: Omega – volume: 12 start-page: 652 year: 2012 end-page: 662 ident: bib22 article-title: A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking publication-title: Appl. Soft Comput. – volume: 9 start-page: 578 year: 2012 end-page: 595 ident: bib65 article-title: Adaptive hybrid algorithms for the sequence-dependent setup time permutation flow shop scheduling problem publication-title: IEEE Trans. Autom. Sci. Eng. – volume: 61 start-page: 290 year: 2016 end-page: 301 ident: bib30 article-title: A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime publication-title: Expert Syst. Appl. – volume: 10 start-page: 741 year: 2013 end-page: 756 ident: bib12 article-title: A high performing memetic algorithm for the flowshop scheduling problem with blocking publication-title: IEEE Trans. Autom. Sci. Eng. – start-page: 1 year: 2017 end-page: 15 ident: bib35 article-title: An evolutionary clustering search for the total tardiness blocking flow shop problem publication-title: J. Intell. Manuf. – year: 2015 ident: bib39 article-title: Scheduling Theory, Algorithms, and Systems – volume: 103 start-page: 129 year: 1997 end-page: 138 ident: bib49 article-title: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs publication-title: Eur. J. Oper. Res. – volume: 7 start-page: 729 year: 2013 end-page: 754 ident: bib13 article-title: A competitive variable neighbourhood search algorithm for the blocking flow shop problem publication-title: Eur. J. Ind. Eng. – volume: 187 start-page: 1143 year: 2008 end-page: 1159 ident: bib64 article-title: An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives publication-title: Eur. J. Oper. Res. – volume: 111 start-page: 331 year: 2017 end-page: 351 ident: bib34 article-title: Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness publication-title: Comput. Ind. Eng. – volume: 44 start-page: 41 year: 2014 end-page: 50 ident: bib47 article-title: An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem publication-title: Omega – volume: 11 start-page: 91 year: 1983 end-page: 95 ident: bib50 article-title: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem publication-title: Omega – volume: 23 start-page: 301 year: 2012 end-page: 308 ident: bib27 article-title: An iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time criteria publication-title: Int. J. Ind. Eng. – volume: 3 start-page: 295 year: 2016 end-page: 311 ident: bib17 article-title: Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem publication-title: J. Comput. Des. Eng. – volume: 47 start-page: 65 year: 1990 end-page: 74 ident: bib48 article-title: Some efficient heuristic methods for the flow shop sequencing problem publication-title: Eur. J. Oper. Res. – volume: 40 start-page: 218 year: 2012 end-page: 229 ident: bib8 article-title: Effective heuristics for the blocking flowshop scheduling problem with makespan minimization publication-title: Omega – volume: 51 start-page: 5238 year: 2013 end-page: 5252 ident: bib33 article-title: An efficient iterated local search algorithm for the total tardiness blocking flow shop problem publication-title: Int. J. Prod. Res. – volume: 38 start-page: 57 year: 2010 end-page: 67 ident: bib53 article-title: Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem publication-title: Omega – start-page: 1 year: 2017 end-page: 18 ident: bib38 article-title: Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking publication-title: Ann. Oper. Res. – volume: 60 start-page: 1149 year: 2011 end-page: 1159 ident: bib10 article-title: An improved artificial bee colony algorithm for the blocking flowshop scheduling problem publication-title: Int. J. Adv. Manuf. Technol. – volume: 47 start-page: 1 year: 2015 end-page: 20 ident: bib24 article-title: A discrete artificial bee colony algorithm incorporating differential evolution for the flow-shop scheduling problem with blocking publication-title: Eng. Optim. – volume: 37 start-page: 7929 year: 2010 end-page: 7936 ident: bib26 article-title: Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms publication-title: Expert Syst. Appl. – volume: 25 start-page: 1114 year: 2012 end-page: 1120 ident: bib51 article-title: A new evolutionary clustering search for a no-wait flow shop problem with set-up times publication-title: Eng. Appl. Artif. Intell. – volume: 39 start-page: 293 year: 2011 end-page: 301 ident: bib14 article-title: An iterated greedy algorithm for the flowshop scheduling problem with blocking publication-title: Omega – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: bib46 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Annal. Discrete Math. – volume: 20 start-page: 1067 year: 2012 end-page: 1073 ident: bib28 article-title: A discrete artificial Bee colony algorithm for minimizing the total flow time in the blocking flow shop scheduling publication-title: Chin. J. Chem. Eng. – volume: 55 start-page: 755 year: 2011 end-page: 762 ident: bib19 article-title: Solving the blocking flow shop scheduling problem by a dynamic multi-swarm particle swarm optimizer publication-title: Int. J. Adv. Manuf. Technol. – volume: 169 start-page: 855 year: 2006 end-page: 864 ident: bib3 article-title: Complexity of flowshop scheduling problems with a new blocking constraint publication-title: Eur. J. Oper. Res. – volume: 165 start-page: 34 year: 2005 end-page: 54 ident: bib57 article-title: Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics publication-title: Eur. J. Oper. Res. – volume: 9 start-page: 31 year: 2016 end-page: 40 ident: bib42 article-title: Water wave optimization algorithm for solving economic dispatch problems with generator constraints publication-title: Int. J. Intell. Eng. Syst. – volume: 30 start-page: 416 year: 2006 end-page: 424 ident: bib63 article-title: An ant colony algorithm for scheduling in flowshops with sequence-dependent setup times of jobs publication-title: Int. J. Adv. Manuf. Technol. – start-page: 1 year: 2017 end-page: 27 ident: bib25 article-title: Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem publication-title: Eng. Optim. – volume: 303 start-page: 89 year: 2017 end-page: 112 ident: bib54 article-title: Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times publication-title: Appl. Math. Comput. – volume: 84 start-page: 516 year: 2016 end-page: 535 ident: bib4 article-title: Preprocessing and tightening methods for time-indexed MIP chemical production scheduling models publication-title: Comput. Chem. Eng. – volume: 51 start-page: 2200 year: 2013 end-page: 2218 ident: bib23 article-title: Scheduling flow shops with blocking using a discrete self-organising migrating algorithm publication-title: Int. J. Prod. Res. – volume: 37 start-page: 509 year: 2010 end-page: 520 ident: bib7 article-title: A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems publication-title: Comput. Oper. Res. – volume: 45 start-page: 351 year: 2014 end-page: 362 ident: bib67 article-title: An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times publication-title: Int. J. Syst. Sci. – volume: 15 start-page: 617 year: 2009 end-page: 644 ident: bib70 article-title: A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization publication-title: J. Heuristics – start-page: 807 year: 2015 end-page: 813 ident: bib41 article-title: A simplified water wave optimization algorithm publication-title: 2015 IEEE Congress on Evolutionary Computation (CEC) – volume: 39 start-page: 2880 year: 2012 end-page: 2887 ident: bib11 article-title: A three-phase algorithm for flowshop scheduling with blocking to minimize makespan publication-title: Comput. Oper. Res. – volume: 9 start-page: 71 year: 2016 ident: bib31 article-title: A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion publication-title: Algorithms – volume: 40 start-page: 1729 year: 2013 end-page: 1743 ident: bib52 article-title: A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem publication-title: Comput. Oper. Res. – volume: 54 start-page: 1 year: 2016 end-page: 14 ident: bib15 article-title: New block properties for flowshop scheduling with blocking and their application in an iterated greedy algorithm publication-title: Int. J. Prod. Res. – volume: 8 start-page: 1 year: 2016 end-page: 9 ident: bib37 article-title: A discrete group search optimizer for blocking flow shop multi-objective scheduling publication-title: Adv. Mech. Eng. – volume: 37 start-page: 960 year: 2010 end-page: 969 ident: bib1 article-title: A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times publication-title: Comput. Oper. Res. – volume: 54 start-page: 6782 year: 2016 end-page: 6797 ident: bib16 article-title: Solving the blocking flow shop scheduling problem with makespan using a modified fruit fly optimisation algorithm publication-title: Int. J. Prod. Res. – volume: 91 start-page: 347 year: 2018 end-page: 363 ident: bib68 article-title: A discrete Water Wave Optimization algorithm for no-wait flow shop scheduling problem publication-title: Expert Syst. Appl. – volume: 42 start-page: 6155 year: 2015 end-page: 6167 ident: bib2 article-title: An efficient Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with total flowtime minimization publication-title: Expert Syst. Appl. – volume: 77 start-page: 111 year: 2017 end-page: 126 ident: bib18 article-title: Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion publication-title: Comput. Oper. Res. – volume: 41 start-page: 383 year: 2013 end-page: 389 ident: bib9 article-title: Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm publication-title: Omega – start-page: 2789 year: 2015 end-page: 2796 ident: bib62 article-title: A populated local search with differential evolution for blocking flowshop scheduling problem publication-title: 2015 IEEE Congress on Evolutionary Computation (CEC) – year: 2008 ident: bib60 article-title: Design and Analysis of Experiments – start-page: 1971 year: 2016 end-page: 1976 ident: bib44 article-title: A novel water wave optimization based memetic algorithm for flow-shop scheduling publication-title: 2016 IEEE Congress on Evolutionary Computation (CEC) – volume: 91 start-page: 347 year: 2018 ident: 10.1016/j.swevo.2017.12.005_bib68 article-title: A discrete Water Wave Optimization algorithm for no-wait flow shop scheduling problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2017.09.028 – volume: 54 start-page: 6782 issue: 22 year: 2016 ident: 10.1016/j.swevo.2017.12.005_bib16 article-title: Solving the blocking flow shop scheduling problem with makespan using a modified fruit fly optimisation algorithm publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2016.1177671 – start-page: 2789 year: 2015 ident: 10.1016/j.swevo.2017.12.005_bib62 article-title: A populated local search with differential evolution for blocking flowshop scheduling problem – start-page: 137 year: 2015 ident: 10.1016/j.swevo.2017.12.005_bib45 article-title: Water wave optimization for the traveling salesman problem – volume: 40 start-page: 1729 issue: 7 year: 2013 ident: 10.1016/j.swevo.2017.12.005_bib52 article-title: A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2013.01.005 – volume: 264 start-page: 66 issue: 1 year: 2018 ident: 10.1016/j.swevo.2017.12.005_bib66 article-title: Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2017.06.027 – volume: 47 start-page: 65 issue: 1 year: 1990 ident: 10.1016/j.swevo.2017.12.005_bib48 article-title: Some efficient heuristic methods for the flow shop sequencing problem publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(90)90090-X – volume: 12 start-page: 652 issue: 2 year: 2012 ident: 10.1016/j.swevo.2017.12.005_bib22 article-title: A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.09.021 – volume: 55 start-page: 755 issue: 5 year: 2011 ident: 10.1016/j.swevo.2017.12.005_bib19 article-title: Solving the blocking flow shop scheduling problem by a dynamic multi-swarm particle swarm optimizer publication-title: Int. J. Adv. Manuf. Technol. doi: 10.1007/s00170-010-3111-7 – volume: 74 start-page: 41 issue: 5 year: 2017 ident: 10.1016/j.swevo.2017.12.005_bib36 article-title: Efficient heuristics for the parallel blocking flow shop scheduling problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2017.01.006 – volume: 52 start-page: 260 year: 2014 ident: 10.1016/j.swevo.2017.12.005_bib61 article-title: A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2013.09.014 – volume: 97 start-page: 128 year: 2016 ident: 10.1016/j.swevo.2017.12.005_bib55 article-title: An effective hybrid biogeography-based optimization algorithm for the distributed assembly permutation flow-shop scheduling problem publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2016.05.005 – volume: 77 start-page: 111 issue: 1 year: 2017 ident: 10.1016/j.swevo.2017.12.005_bib18 article-title: Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2016.07.002 – volume: 20 start-page: 679 issue: 4 year: 2012 ident: 10.1016/j.swevo.2017.12.005_bib21 article-title: Clustered enhanced differential evolution for the blocking flow shop scheduling problem publication-title: Cent. Eur. J. Oper. Res. doi: 10.1007/s10100-011-0198-3 – volume: 111 start-page: 331 year: 2017 ident: 10.1016/j.swevo.2017.12.005_bib34 article-title: Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2017.07.037 – volume: 39 start-page: 293 issue: 3 year: 2011 ident: 10.1016/j.swevo.2017.12.005_bib14 article-title: An iterated greedy algorithm for the flowshop scheduling problem with blocking publication-title: Omega doi: 10.1016/j.omega.2010.07.007 – volume: 61 start-page: 290 issue: 11 year: 2016 ident: 10.1016/j.swevo.2017.12.005_bib30 article-title: A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2016.05.040 – volume: 9 start-page: 71 issue: 4 year: 2016 ident: 10.1016/j.swevo.2017.12.005_bib31 article-title: A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion publication-title: Algorithms doi: 10.3390/a9040071 – volume: 87 start-page: 30 issue: 9 year: 2015 ident: 10.1016/j.swevo.2017.12.005_bib29 article-title: Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2015.04.013 – start-page: 807 year: 2015 ident: 10.1016/j.swevo.2017.12.005_bib41 article-title: A simplified water wave optimization algorithm – start-page: 1971 year: 2016 ident: 10.1016/j.swevo.2017.12.005_bib44 article-title: A novel water wave optimization based memetic algorithm for flow-shop scheduling – volume: 44 start-page: 41 issue: 2 year: 2014 ident: 10.1016/j.swevo.2017.12.005_bib47 article-title: An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem publication-title: Omega doi: 10.1016/j.omega.2013.10.002 – volume: 87 start-page: 39 issue: 1 year: 2004 ident: 10.1016/j.swevo.2017.12.005_bib59 article-title: A note on constructive heuristics for the flowshop problem with blocking publication-title: Int. J. Prod. Econ. doi: 10.1016/S0925-5273(03)00065-3 – volume: 51 start-page: 5238 issue: 17 year: 2013 ident: 10.1016/j.swevo.2017.12.005_bib33 article-title: An efficient iterated local search algorithm for the total tardiness blocking flow shop problem publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2013.802390 – volume: 84 start-page: 516 year: 2016 ident: 10.1016/j.swevo.2017.12.005_bib4 article-title: Preprocessing and tightening methods for time-indexed MIP chemical production scheduling models publication-title: Comput. Chem. Eng. doi: 10.1016/j.compchemeng.2015.10.003 – start-page: 1 year: 2017 ident: 10.1016/j.swevo.2017.12.005_bib35 article-title: An evolutionary clustering search for the total tardiness blocking flow shop problem publication-title: J. Intell. Manuf. – volume: 44 start-page: 510 issue: 3 year: 1996 ident: 10.1016/j.swevo.2017.12.005_bib6 article-title: A Survey of machine scheduling problems with blocking and No-Wait in process publication-title: Oper. Res. doi: 10.1287/opre.44.3.510 – volume: 37 start-page: 509 issue: 3 year: 2010 ident: 10.1016/j.swevo.2017.12.005_bib7 article-title: A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2008.12.004 – volume: 54 start-page: 1 issue: 16 year: 2016 ident: 10.1016/j.swevo.2017.12.005_bib15 article-title: New block properties for flowshop scheduling with blocking and their application in an iterated greedy algorithm publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2015.1076941 – volume: 30 start-page: 416 issue: 5 year: 2006 ident: 10.1016/j.swevo.2017.12.005_bib63 article-title: An ant colony algorithm for scheduling in flowshops with sequence-dependent setup times of jobs publication-title: Int. J. Adv. Manuf. Technol. doi: 10.1007/s00170-005-0093-y – volume: 7 start-page: 729 issue: 6 year: 2013 ident: 10.1016/j.swevo.2017.12.005_bib13 article-title: A competitive variable neighbourhood search algorithm for the blocking flow shop problem publication-title: Eur. J. Ind. Eng. doi: 10.1504/EJIE.2013.058392 – volume: 9 start-page: 578 issue: 3 year: 2012 ident: 10.1016/j.swevo.2017.12.005_bib65 article-title: Adaptive hybrid algorithms for the sequence-dependent setup time permutation flow shop scheduling problem publication-title: IEEE Trans. Autom. Sci. Eng. doi: 10.1109/TASE.2012.2192729 – volume: 23 start-page: 301 issue: 4 year: 2012 ident: 10.1016/j.swevo.2017.12.005_bib27 article-title: An iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time criteria publication-title: Int. J. Ind. Eng. – volume: 37 start-page: 7929 issue: 12 year: 2010 ident: 10.1016/j.swevo.2017.12.005_bib26 article-title: Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2010.04.042 – start-page: 1 year: 2017 ident: 10.1016/j.swevo.2017.12.005_bib25 article-title: Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem publication-title: Eng. Optim. – year: 2015 ident: 10.1016/j.swevo.2017.12.005_bib39 – volume: 37 start-page: 925 issue: 6 year: 1989 ident: 10.1016/j.swevo.2017.12.005_bib58 article-title: Sequencing in an assembly line with blocking to minimize cycle time publication-title: Oper. Res. doi: 10.1287/opre.37.6.925 – volume: 55 start-page: 1227 issue: 5 year: 2017 ident: 10.1016/j.swevo.2017.12.005_bib5 article-title: Value creation through design for scalability of reconfigurable manufacturing systems publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2016.1145821 – volume: 3 start-page: 295 issue: 4 year: 2016 ident: 10.1016/j.swevo.2017.12.005_bib17 article-title: Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem publication-title: J. Comput. Des. Eng. – volume: 103 start-page: 129 issue: 1 year: 1997 ident: 10.1016/j.swevo.2017.12.005_bib49 article-title: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(96)00273-1 – volume: 38 start-page: 57 issue: 1–2 year: 2010 ident: 10.1016/j.swevo.2017.12.005_bib53 article-title: Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem publication-title: Omega doi: 10.1016/j.omega.2009.04.002 – volume: 55 start-page: 1 issue: 5 year: 2015 ident: 10.1016/j.swevo.2017.12.005_bib40 article-title: Water wave optimization: a new nature-inspired metaheuristic publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.10.008 – volume: 9 start-page: 31 issue: 4 year: 2016 ident: 10.1016/j.swevo.2017.12.005_bib42 article-title: Water wave optimization algorithm for solving economic dispatch problems with generator constraints publication-title: Int. J. Intell. Eng. Syst. doi: 10.22266/ijies2016.1231.04 – start-page: 175 year: 2015 ident: 10.1016/j.swevo.2017.12.005_bib43 article-title: Accelerometer-based human activity classification using Water Wave Optimization approach – volume: 51 start-page: 2200 issue: 8 year: 2013 ident: 10.1016/j.swevo.2017.12.005_bib23 article-title: Scheduling flow shops with blocking using a discrete self-organising migrating algorithm publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2012.711968 – volume: 11 start-page: 91 issue: 1 year: 1983 ident: 10.1016/j.swevo.2017.12.005_bib50 article-title: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem publication-title: Omega doi: 10.1016/0305-0483(83)90088-9 – volume: 40 start-page: 218 issue: 2 year: 2012 ident: 10.1016/j.swevo.2017.12.005_bib8 article-title: Effective heuristics for the blocking flowshop scheduling problem with makespan minimization publication-title: Omega doi: 10.1016/j.omega.2011.06.002 – volume: 1 start-page: 3 issue: 1 year: 2011 ident: 10.1016/j.swevo.2017.12.005_bib71 article-title: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms publication-title: Swarm Evolut. Comput. doi: 10.1016/j.swevo.2011.02.002 – volume: 47 start-page: 1 issue: 7 year: 2015 ident: 10.1016/j.swevo.2017.12.005_bib24 article-title: A discrete artificial bee colony algorithm incorporating differential evolution for the flow-shop scheduling problem with blocking publication-title: Eng. Optim. doi: 10.1080/0305215X.2014.928817 – volume: 15 start-page: 617 issue: 6 year: 2009 ident: 10.1016/j.swevo.2017.12.005_bib70 article-title: A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization publication-title: J. Heuristics doi: 10.1007/s10732-008-9080-4 – volume: 303 start-page: 89 year: 2017 ident: 10.1016/j.swevo.2017.12.005_bib54 article-title: Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times publication-title: Appl. Math. Comput. – volume: 42 start-page: 6155 issue: 15–16 year: 2015 ident: 10.1016/j.swevo.2017.12.005_bib2 article-title: An efficient Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with total flowtime minimization publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2015.03.026 – volume: 6 start-page: 65 issue: 2 year: 1979 ident: 10.1016/j.swevo.2017.12.005_bib69 article-title: A simple sequentially rejective multiple test procedure publication-title: Scand. J. Stat. – volume: 39 start-page: 2880 issue: 11 year: 2012 ident: 10.1016/j.swevo.2017.12.005_bib11 article-title: A three-phase algorithm for flowshop scheduling with blocking to minimize makespan publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2012.02.020 – volume: 5 start-page: 287 issue: 1 year: 1979 ident: 10.1016/j.swevo.2017.12.005_bib46 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Annal. Discrete Math. doi: 10.1016/S0167-5060(08)70356-X – volume: 8 start-page: 1 issue: 8 year: 2016 ident: 10.1016/j.swevo.2017.12.005_bib37 article-title: A discrete group search optimizer for blocking flow shop multi-objective scheduling publication-title: Adv. Mech. Eng. – volume: 39 start-page: 1506 issue: 7 year: 2012 ident: 10.1016/j.swevo.2017.12.005_bib56 article-title: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.08.022 – volume: 20 start-page: 1067 issue: 6 year: 2012 ident: 10.1016/j.swevo.2017.12.005_bib28 article-title: A discrete artificial Bee colony algorithm for minimizing the total flow time in the blocking flow shop scheduling publication-title: Chin. J. Chem. Eng. doi: 10.1016/S1004-9541(12)60588-6 – volume: 169 start-page: 855 issue: 3 year: 2006 ident: 10.1016/j.swevo.2017.12.005_bib3 article-title: Complexity of flowshop scheduling problems with a new blocking constraint publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2004.08.046 – volume: 61 start-page: 76 issue: 1 year: 2011 ident: 10.1016/j.swevo.2017.12.005_bib20 article-title: A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2011.02.013 – year: 2008 ident: 10.1016/j.swevo.2017.12.005_bib60 – volume: 37 start-page: 960 issue: 5 year: 2010 ident: 10.1016/j.swevo.2017.12.005_bib1 article-title: A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2009.08.001 – volume: 45 start-page: 351 issue: 3 year: 2014 ident: 10.1016/j.swevo.2017.12.005_bib67 article-title: An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times publication-title: Int. J. Syst. Sci. doi: 10.1080/00207721.2012.723054 – volume: 10 start-page: 741 issue: 3 year: 2013 ident: 10.1016/j.swevo.2017.12.005_bib12 article-title: A high performing memetic algorithm for the flowshop scheduling problem with blocking publication-title: IEEE Trans. Autom. Sci. Eng. doi: 10.1109/TASE.2012.2219860 – volume: 25 start-page: 1114 issue: 6 year: 2012 ident: 10.1016/j.swevo.2017.12.005_bib51 article-title: A new evolutionary clustering search for a no-wait flow shop problem with set-up times publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2012.05.017 – volume: 187 start-page: 1143 issue: 3 year: 2008 ident: 10.1016/j.swevo.2017.12.005_bib64 article-title: An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.07.029 – volume: 37 start-page: 272 issue: 2 year: 2009 ident: 10.1016/j.swevo.2017.12.005_bib32 article-title: Some heuristic algorithms for total tardiness minimization in a flowshop with blocking publication-title: Omega doi: 10.1016/j.omega.2007.01.003 – volume: 41 start-page: 383 issue: 2 year: 2013 ident: 10.1016/j.swevo.2017.12.005_bib9 article-title: Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm publication-title: Omega doi: 10.1016/j.omega.2012.03.006 – volume: 60 start-page: 1149 issue: 9–12 year: 2011 ident: 10.1016/j.swevo.2017.12.005_bib10 article-title: An improved artificial bee colony algorithm for the blocking flowshop scheduling problem publication-title: Int. J. Adv. Manuf. Technol. – volume: 165 start-page: 34 issue: 1 year: 2005 ident: 10.1016/j.swevo.2017.12.005_bib57 article-title: Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2004.01.022 – start-page: 1 year: 2017 ident: 10.1016/j.swevo.2017.12.005_bib38 article-title: Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking publication-title: Ann. Oper. Res. |
| SSID | ssj0000602559 |
| Score | 2.3693447 |
| Snippet | This paper considers n-job m-machines blocking flow-shop scheduling problem (BFSP) with sequence-dependent setup times (SDST), which has important... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 53 |
| SubjectTerms | Flow shop with blocking Heuristic Metaheuristic Scheduling Setup times |
| Title | A novel discrete water wave optimization algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times |
| URI | https://dx.doi.org/10.1016/j.swevo.2017.12.005 |
| Volume | 40 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) issn: 2210-6502 databaseCode: GBLVA dateStart: 20110101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0000602559 providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier ScienceDirect issn: 2210-6502 databaseCode: ACRLP dateStart: 20110301 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0000602559 providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] issn: 2210-6502 databaseCode: AIKHN dateStart: 20110301 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0000602559 providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect (Elsevier) issn: 2210-6502 databaseCode: .~1 dateStart: 20110301 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0000602559 providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals issn: 2210-6502 databaseCode: AKRWK dateStart: 20110301 customDbUrl: isFulltext: true mediaType: online dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000602559 providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8JAEN4QvHjxbcQH2YNHV9rt9sGREAlq5KIk3JrtPgQDbQMFbsaf7mzZEk0MBy9tutlpmp125pvpzH4I3TKq3KTNIghLIp-wkAvSjqQkkgfcT5jmtOSMfBkE_SF7GvmjGupWvTCmrNLa_o1NL621HWnZ1Wzlk0nrlUK0AvgCMDXAXkDxpoOdhYbF4P7T3eZZnKBEzYZjDuYTI1BtPlSWeS3WamWaAN2wTAsaGru_HNQPp9M7QgcWLeLO5oGOUU2lJ-iwYmLA9sM8RV8dnGYrNcWmyXYOOBivuZmw5iuFM7AKM9tuifn0PZtPivEMA1rFCbgykyvHepqtyWKc5RiiXfA-pkkdW7IZbHK1uKq5JhVtbgFDxTLHJTv9GRr2Ht66fWK5FYgAp1UQ7vsyETSkVFJXeW0_ktSREFwoJ9A-Z24ER27-6QktwSpE3KMQ_chEJ3Bi2jtH9TRL1QXCQjiSM0G1CgQLuJtwuG_EnVAzV_PQayBaLWgs7Mbjhv9iGlcVZh9xqYXYaCF2aQxaaKC7rVC-2Xdj9_Sg0lT86_WJwTPsErz8r-AV2oeraFM1do3qxXypbgCfFEmzfAGbaK_z-NwffAPJlejc |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8JAEN4gHvTi24jPPXh0pV22D46EaFDBi5Bw22z3oRigBArcjD_d2bIlmhgPXtqk3Wmane3MN9OZ_RC6ZlT7SZ3FEJbEAWGRkKQeK0WUCEWQMCNozhnZeQ5bPfbYD_ol1Cx6YWxZpbP9K5ueW2t3pepmszoZDKovFKIVwBeAqQH2AorfQJssoJGNwG4__HWixQtz2GxJ5kCAWIli96G8zmu21AvbBehHeV7Q8tj95qG-eZ37PbTj4CJurN5oH5X0-ADtFlQM2H2Zh-izgcfpQg-x7bKdAhDGS2EHLMVC4xTMwsj1W2IxfE2ng-xthAGu4gR8mU2WYzNMl2T2lk4whLvgfmyXOnZsM9gma3FRdE0K3twMLmXzCc7p6Y9Q7_6u22wRR65AJHitjIggUImkEaWK-rpWD2JFPQXRhfZCEwjmx3AU9qeeNArMQixqFMIflZgETszUjlF5nI71CcJSekowSY0OJQuFnwh4biy8yDDfiKhWQbSYUC7dzuOWAGPIixKzd55rgVstcJ9y0EIF3ayFJquNN_4eHhaa4j_WDwfX8Jfg6X8Fr9BWq9tp8_bD89MZ2oY78aqE7ByVs-lcXwBYyZLLfDF-ATmE6nE |
| 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=A+novel+discrete+water+wave+optimization+algorithm+for+blocking+flow-shop+scheduling+problem+with+sequence-dependent+setup+times&rft.jtitle=Swarm+and+evolutionary+computation&rft.au=Shao%2C+Zhongshi&rft.au=Pi%2C+Dechang&rft.au=Shao%2C+Weishi&rft.date=2018-06-01&rft.pub=Elsevier+B.V&rft.issn=2210-6502&rft.volume=40&rft.spage=53&rft.epage=75&rft_id=info:doi/10.1016%2Fj.swevo.2017.12.005&rft.externalDocID=S2210650217306259 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2210-6502&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2210-6502&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2210-6502&client=summon |