Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems
•We present an Automatic Algorithm Design system for the hybrid flowshop problem.•Algorithm components are combined according to a grammar to generate new algorithms.•New algorithms are compared in three objectives with the state-of-the-art algorithms.•Experiments prove our approach to be competitiv...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research Jg. 282; H. 3; S. 835 - 845 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.05.2020
|
| Schlagworte: | |
| ISSN: | 0377-2217, 1872-6860 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | •We present an Automatic Algorithm Design system for the hybrid flowshop problem.•Algorithm components are combined according to a grammar to generate new algorithms.•New algorithms are compared in three objectives with the state-of-the-art algorithms.•Experiments prove our approach to be competitive against state-of-the-art algorithms.
Industrial production scheduling problems are challenges that researchers have been trying to solve for decades. Many practical scheduling problems such as the hybrid flowshop are NP-hard. As a result, researchers resort to metaheuristics to obtain effective and efficient solutions. The traditional design process of metaheuristics is mainly manual, often metaphor-based, biased by previous experience and prone to producing overly tailored methods that only work well on the tested problems and objectives. In this paper, we use an Automatic Algorithm Design (AAD) methodology to eliminate these limitations. AAD is capable of composing algorithms from components with minimal human intervention. We test the proposed AAD for three different optimization objectives in the hybrid flowshop. Comprehensive computational and statistical testing demonstrates that automatically designed algorithms outperform specifically tailored state-of-the-art methods for the tested objectives in most cases. |
|---|---|
| AbstractList | •We present an Automatic Algorithm Design system for the hybrid flowshop problem.•Algorithm components are combined according to a grammar to generate new algorithms.•New algorithms are compared in three objectives with the state-of-the-art algorithms.•Experiments prove our approach to be competitive against state-of-the-art algorithms.
Industrial production scheduling problems are challenges that researchers have been trying to solve for decades. Many practical scheduling problems such as the hybrid flowshop are NP-hard. As a result, researchers resort to metaheuristics to obtain effective and efficient solutions. The traditional design process of metaheuristics is mainly manual, often metaphor-based, biased by previous experience and prone to producing overly tailored methods that only work well on the tested problems and objectives. In this paper, we use an Automatic Algorithm Design (AAD) methodology to eliminate these limitations. AAD is capable of composing algorithms from components with minimal human intervention. We test the proposed AAD for three different optimization objectives in the hybrid flowshop. Comprehensive computational and statistical testing demonstrates that automatically designed algorithms outperform specifically tailored state-of-the-art methods for the tested objectives in most cases. |
| Author | Pagnozzi, Federico Alfaro-Fernández, Pedro Ruiz, Rubén Stützle, Thomas |
| Author_xml | – sequence: 1 givenname: Pedro orcidid: 0000-0001-7853-983X surname: Alfaro-Fernández fullname: Alfaro-Fernández, Pedro email: pedroaf@iti.upv.es organization: Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico de Informática, Ciudad Politécnica de la Innovación, Universitat Politècnica de València, Edifico 8G, Acc. B. Camino de Vera s/n, 46021 València, Spain – sequence: 2 givenname: Rubén orcidid: 0000-0003-3295-3888 surname: Ruiz fullname: Ruiz, Rubén email: rruiz@eio.upv.es organization: Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico de Informática, Ciudad Politécnica de la Innovación, Universitat Politècnica de València, Edifico 8G, Acc. B. Camino de Vera s/n, 46021 València, Spain – sequence: 3 givenname: Federico orcidid: 0000-0003-4529-4711 surname: Pagnozzi fullname: Pagnozzi, Federico email: federico.pagnozzi@ulb.ac.be organization: IRIDIA, Université Libre de Bruxelles (ULB), CP 194/6, Av. F. Roosevelt 50, Brussels B-1050, Belgium – sequence: 4 givenname: Thomas orcidid: 0000-0002-5820-0473 surname: Stützle fullname: Stützle, Thomas email: stuetzle@ulb.ac.be organization: IRIDIA, Université Libre de Bruxelles (ULB), CP 194/6, Av. F. Roosevelt 50, Brussels B-1050, Belgium |
| BookMark | eNp9kM1Kw0AUhQepYFt9AVfzAol3Jn8TcFOrtUJBQV0Pk8lNOyHJlJlU6ds3oa5cdHXhwHc495uRSWc7JOSeQciApQ91iLV1IQeWD0EIEF-RKRMZD1KRwoRMIcqygHOW3ZCZ9zUAsIQlU_K0OPS2Vb3RdNFsrTP9rqXP6M22o5V1dH0snCnpqrG_fmf39FPvsDw0ptvSD2eLBlt_S64r1Xi8-7tz8r16-Vqug83769tysQl0DHkfxFrElWA5VEoAQiaKPBYcYp4q0EWkNJYJVygwjdNhdMl4lOmkjBKmqkQwFs2JOPdqZ713WElt-mG57XqnTCMZyNGFrOXoQo4uxmxwMaD8H7p3plXueBl6PEM4PPVj0EmvDXbDTuNQ97K05hJ-ArCLek0 |
| CitedBy_id | crossref_primary_10_1016_j_asoc_2021_107305 crossref_primary_10_1155_2022_4457167 crossref_primary_10_1007_s11590_022_01966_7 crossref_primary_10_1016_j_swevo_2024_101681 crossref_primary_10_1109_TASE_2021_3062994 crossref_primary_10_1016_j_ejor_2022_02_019 crossref_primary_10_1016_j_eswa_2024_124349 crossref_primary_10_1016_j_cie_2021_107843 crossref_primary_10_1007_s40747_023_01288_w crossref_primary_10_1016_j_ejor_2024_06_001 crossref_primary_10_1111_itor_13108 crossref_primary_10_1016_j_asoc_2023_110187 crossref_primary_10_1016_j_asoc_2023_110594 crossref_primary_10_1111_itor_12902 crossref_primary_10_3390_fractalfract8040223 crossref_primary_10_1038_s41598_025_16174_3 crossref_primary_10_3390_math12233709 crossref_primary_10_1016_j_swevo_2022_101143 crossref_primary_10_1016_j_knosys_2021_107819 |
| Cites_doi | 10.1016/j.ejor.2005.12.009 10.1016/j.artint.2015.11.002 10.1504/IJLEG.2013.054428 10.1016/j.cor.2016.11.022 10.1002/nav.3800010110 10.1007/s00170-013-4819-y 10.1016/j.cor.2014.05.020 10.1111/itor.12001 10.1057/jors.1988.63 10.1016/j.cie.2013.04.007 10.1016/S0377-2217(96)00273-1 10.1016/j.ejor.2005.02.001 10.1016/j.asoc.2014.02.005 10.1023/B:HEUR.0000026900.92269.ec 10.1109/TEVC.2011.2160401 10.1016/j.asoc.2015.02.006 10.1016/j.ejor.2009.09.024 10.1016/j.asoc.2013.03.006 10.1016/j.amc.2011.02.108 10.1016/j.neucom.2013.07.056 10.1613/jair.2861 10.1016/j.engappai.2010.01.008 10.1016/j.asoc.2014.07.005 10.1109/TEVC.2013.2240304 10.1016/0305-0483(83)90088-9 10.1051/ro:1999108 10.1016/j.asoc.2012.01.011 10.1016/j.cor.2016.12.021 10.1051/ro:2000103 10.1109/TEVC.2011.2182651 10.1016/j.orp.2016.09.002 10.1016/j.cor.2010.10.008 10.1016/j.ins.2014.02.152 10.1080/0305215X.2012.737784 10.1016/j.omega.2013.12.004 10.1007/978-3-319-91446-6_9 |
| ContentType | Journal Article |
| Copyright | 2019 Elsevier B.V. |
| Copyright_xml | – notice: 2019 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2019.10.004 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 845 |
| ExternalDocumentID | 10_1016_j_ejor_2019_10_004 S0377221719308203 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c409t-4c84f8190fa80e078b94820426a0cb3aced52ae8e646686d1237c5d351af58113 |
| ISICitedReferencesCount | 26 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000513985000003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Tue Nov 18 22:22:11 EST 2025 Sat Nov 29 07:21:19 EST 2025 Fri Feb 23 02:48:58 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Automatic Algorithm Design Automatic algorithm configuration Scheduling Hybrid flowshop |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c409t-4c84f8190fa80e078b94820426a0cb3aced52ae8e646686d1237c5d351af58113 |
| ORCID | 0000-0003-4529-4711 0000-0002-5820-0473 0000-0003-3295-3888 0000-0001-7853-983X |
| OpenAccessLink | https://www.sciencedirect.com/science/article/pii/S0377221719308203 |
| PageCount | 11 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2019_10_004 crossref_primary_10_1016_j_ejor_2019_10_004 elsevier_sciencedirect_doi_10_1016_j_ejor_2019_10_004 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-05-01 |
| PublicationDateYYYYMMDD | 2020-05-01 |
| PublicationDate_xml | – month: 05 year: 2020 text: 2020-05-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2020 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Cahon, Melab, Talbi (bib0005) 2004; 10 Dubois-Lacoste, López-Ibáñez, Stützle (bib0010) 2011; 38 Johnson (bib0020) 1954; 1 Marmion, Mascia, López-Ibáñez, Stützle (bib0032) 2013 Marichelvam, Prabaharan, Yang (bib0030) 2014; 19 Lourenço, Martin, Stützle (bib0028) 2010 Talbi (bib0044) 2009; 74 Khalouli, Ghedjati, Hamzaoui (bib0021) 2010; 23 Bożejko, Gnatowski, Niżyński, Affenzeller, Beham (bib0002) 2018; 761 Mascia, López-Ibáñez, Dubois-Lacoste, Stützle (bib0033) 2014; 51 Wang, Wang, Liu, Xu (bib0046) 2013; 68 Gupta, Stafford (bib0015) 2006; 169 Stützle, López-Ibáñez (bib0043) 2019 Li, Pan, Wang (bib0023) 2014; 24 Nawaz, Enscore, Ham (bib0035) 1983; 11 Cui, Gu (bib0008) 2015; 148 Ruiz, Stützle (bib0040) 2007; 177 Vignier, Billaut, Proust (bib0045) 1999; 33 Hutter, Hoos, Leyton-Brown (bib0018) 2011 Marichelvam, Prabaharan, Yang, Geetha (bib0031) 2013; 5 López-Ibáñez, Dubois-Lacoste, Pérez Cáceres, Birattari, Stützle (bib0026) 2016; 3 Burke, Hyde, Kendall (bib0004) 2012; 16 Franzin, Stützle (bib0013) 2016 Pan, Dong (bib0036) 2014; 277 Wasik, Antczak, Badura, Laskowski, Sternal (bib0047) 2016 (bib0001) 2010 Dubois-Lacoste, Pagnozzi, Stützle (bib0011) 2017; 81 Gupta (bib0014) 1988; 39 Bożejko, Pempera, Smutnicki (bib0003) 2013; 65 Hutter, Stützle, Leyton-Brown, Hoos (bib0019) 2009; 36 Liao, Tjandradjaja, Chung (bib0024) 2012; 12 Marichelvam, Prabaharan, Yang (bib0029) 2014; 18 Pan, Ruiz, Alfaro-Fernández (bib0037) 2017; 80 Hidri, Haouari (bib0016) 2011; 217 Montgomery (bib0034) 2012 KhudaBukhsh, Xu, Hoos, Leyton-Brown (bib0022) 2016; 232 Ruiz, Vázquez-Rodríguez (bib0041) 2010; 205 Framiñan, Leisten, Ruiz (bib0012) 2014 Xu, Wang, Wang, Liu (bib0048) 2013; 45 Pan, Wang, Li, Duan (bib0038) 2014; 45 López-Ibáñez, Kessaci, Stützle (bib0027) 2017 Carlier, Néron (bib0006) 2000; 34 Hoos, Stützle (bib0017) 2004 Ding, Song, Gupta, Zhang, Chiong, Wu (bib0009) 2015; 30 Rajendran, Ziegler (bib0039) 1997; 103 Sörensen (bib0042) 2015; 22 Chung, Liao (bib0007) 2013; 13 López-Ibáñez, Stützle (bib0025) 2012; 16 Hidri (10.1016/j.ejor.2019.10.004_bib0016) 2011; 217 Hutter (10.1016/j.ejor.2019.10.004_bib0019) 2009; 36 Mascia (10.1016/j.ejor.2019.10.004_bib0033) 2014; 51 Bożejko (10.1016/j.ejor.2019.10.004_bib0002) 2018; 761 Cui (10.1016/j.ejor.2019.10.004_bib0008) 2015; 148 Marmion (10.1016/j.ejor.2019.10.004_sbref0032) 2013 Stützle (10.1016/j.ejor.2019.10.004_bib0043) 2019 Marichelvam (10.1016/j.ejor.2019.10.004_bib0031) 2013; 5 Hoos (10.1016/j.ejor.2019.10.004_bib0017) 2004 Marichelvam (10.1016/j.ejor.2019.10.004_bib0030) 2014; 19 Ding (10.1016/j.ejor.2019.10.004_bib0009) 2015; 30 López-Ibáñez (10.1016/j.ejor.2019.10.004_sbref0027) 2017 (10.1016/j.ejor.2019.10.004_bib0001) 2010 Burke (10.1016/j.ejor.2019.10.004_bib0004) 2012; 16 Pan (10.1016/j.ejor.2019.10.004_bib0037) 2017; 80 Ruiz (10.1016/j.ejor.2019.10.004_bib0040) 2007; 177 Dubois-Lacoste (10.1016/j.ejor.2019.10.004_bib0010) 2011; 38 Talbi (10.1016/j.ejor.2019.10.004_bib0044) 2009; 74 Pan (10.1016/j.ejor.2019.10.004_bib0038) 2014; 45 Montgomery (10.1016/j.ejor.2019.10.004_bib0034) 2012 KhudaBukhsh (10.1016/j.ejor.2019.10.004_bib0022) 2016; 232 Xu (10.1016/j.ejor.2019.10.004_bib0048) 2013; 45 Liao (10.1016/j.ejor.2019.10.004_bib0024) 2012; 12 Gupta (10.1016/j.ejor.2019.10.004_bib0014) 1988; 39 Pan (10.1016/j.ejor.2019.10.004_bib0036) 2014; 277 Ruiz (10.1016/j.ejor.2019.10.004_bib0041) 2010; 205 Vignier (10.1016/j.ejor.2019.10.004_bib0045) 1999; 33 Wang (10.1016/j.ejor.2019.10.004_bib0046) 2013; 68 Dubois-Lacoste (10.1016/j.ejor.2019.10.004_bib0011) 2017; 81 Hutter (10.1016/j.ejor.2019.10.004_sbref0018) 2011 Wasik (10.1016/j.ejor.2019.10.004_bib0047) 2016 Chung (10.1016/j.ejor.2019.10.004_bib0007) 2013; 13 Li (10.1016/j.ejor.2019.10.004_bib0023) 2014; 24 Lourenço (10.1016/j.ejor.2019.10.004_sbref0028) 2010 Marichelvam (10.1016/j.ejor.2019.10.004_bib0029) 2014; 18 Nawaz (10.1016/j.ejor.2019.10.004_bib0035) 1983; 11 Bożejko (10.1016/j.ejor.2019.10.004_bib0003) 2013; 65 Framiñan (10.1016/j.ejor.2019.10.004_bib0012) 2014 Cahon (10.1016/j.ejor.2019.10.004_bib0005) 2004; 10 Rajendran (10.1016/j.ejor.2019.10.004_bib0039) 1997; 103 Franzin (10.1016/j.ejor.2019.10.004_bib0013) 2016 Gupta (10.1016/j.ejor.2019.10.004_bib0015) 2006; 169 Carlier (10.1016/j.ejor.2019.10.004_bib0006) 2000; 34 Johnson (10.1016/j.ejor.2019.10.004_bib0020) 1954; 1 Sörensen (10.1016/j.ejor.2019.10.004_bib0042) 2015; 22 López-Ibáñez (10.1016/j.ejor.2019.10.004_bib0025) 2012; 16 Khalouli (10.1016/j.ejor.2019.10.004_bib0021) 2010; 23 López-Ibáñez (10.1016/j.ejor.2019.10.004_bib0026) 2016; 3 |
| References_xml | – volume: 12 start-page: 1755 year: 2012 end-page: 1764 ident: bib0024 article-title: An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem publication-title: Applied Soft Computing – volume: 3 start-page: 43 year: 2016 end-page: 58 ident: bib0026 article-title: The irace package: Iterated racing for automatic algorithm configuration publication-title: Operations Research Perspectives – volume: 761 start-page: 83 year: 2018 end-page: 93 ident: bib0002 article-title: Local optima networks in solving algorithm selection problem for TSP publication-title: Advances in intelligent systems and computing – volume: 81 start-page: 160 year: 2017 end-page: 166 ident: bib0011 article-title: An iterated greedy algorithm with optimization of partial solutions for the permutation flowshop problem publication-title: Computers & Operations Research – volume: 169 start-page: 699 year: 2006 end-page: 711 ident: bib0015 article-title: Flowshop scheduling research after five decades publication-title: European Journal of Operational Research – volume: 80 start-page: 50 year: 2017 end-page: 60 ident: bib0037 article-title: Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows publication-title: Computers & Operations Research – volume: 51 start-page: 190 year: 2014 end-page: 199 ident: bib0033 article-title: Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools publication-title: Computers & Operations Research – year: 2004 ident: bib0017 article-title: Stochastic local search: Foundations and applications – volume: 205 start-page: 1 year: 2010 end-page: 18 ident: bib0041 article-title: The hybrid flow shop scheduling problem publication-title: European Journal of Operational Research – year: 2017 ident: bib0027 article-title: Automatic design of hybrid metaheuristics from algorithmic components publication-title: Technical Report – volume: 34 start-page: 1 year: 2000 end-page: 25 ident: bib0006 article-title: An exact method for solving the multi-processor flow-shop publication-title: RAIRO – Operations Research – volume: 18 start-page: 301 year: 2014 end-page: 305 ident: bib0029 article-title: A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems publication-title: IEEE Transactions on Evolutionary Computation – volume: 177 start-page: 2033 year: 2007 end-page: 2049 ident: bib0040 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: European Journal of Operational Research – start-page: 1341 year: 2016 end-page: 1347 ident: bib0013 article-title: Exploration of metaheuristics through automatic algorithm configuration techniques and algorithmic frameworks publication-title: Proceedings of the 2016 on genetic and evolutionary computation conference, GECCO ’16 companion – start-page: 144 year: 2013 end-page: 158 ident: bib0032 article-title: Automatic design of hybrid stochastic local search algorithms publication-title: Proceedings of the 8th international workshop on hybrid metaheuristics, HM 2013 – volume: 277 start-page: 643 year: 2014 end-page: 655 ident: bib0036 article-title: An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation publication-title: Information Sciences – volume: 68 start-page: 2043 year: 2013 end-page: 2056 ident: bib0046 article-title: An enhanced estimation of distribution algorithm for solving hybrid flow-shop scheduling problem with identical parallel machines publication-title: The International Journal of Advanced Manufacturing Technology – volume: 38 start-page: 1219 year: 2011 end-page: 1236 ident: bib0010 article-title: A hybrid TP + PLS algorithm for bi-objective flow-shop scheduling problems publication-title: Computers & Operations Research – volume: 45 start-page: 42 year: 2014 end-page: 56 ident: bib0038 article-title: A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation publication-title: OMEGA: The International Journal of Management Science – volume: 217 start-page: 8248 year: 2011 end-page: 8263 ident: bib0016 article-title: Bounding strategies for the hybrid flow shop scheduling problem publication-title: Applied Mathematics and Computation – volume: 103 start-page: 129 year: 1997 end-page: 138 ident: bib0039 article-title: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs publication-title: European Journal of Operational Research – year: 2014 ident: bib0012 article-title: Manufacturing scheduling systems: An integrated view on models, methods and tools – start-page: 541 year: 2019 end-page: 579 ident: bib0043 article-title: Automated design of metaheuristic algorithms publication-title: Handbook of metaheuristics – volume: 33 start-page: 117 year: 1999 ident: bib0045 article-title: Les problemes d’ordonnancement de type flow-shop hybride: Etat de l’art publication-title: RAIRO Recherche Operationnelle – volume: 36 start-page: 267 year: 2009 end-page: 306 ident: bib0019 article-title: ParamILS: An automatic algorithm configuration framework publication-title: Journal of Artificial Intelligence Research – volume: 5 start-page: 15 year: 2013 end-page: 29 ident: bib0031 article-title: Solving hybrid flow shop scheduling problems using bat algorithm publication-title: International Journal of Logistics Economics and Globalisation – volume: 23 start-page: 765 year: 2010 end-page: 771 ident: bib0021 article-title: A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop publication-title: Engineering Applications of Artificial Intelligence – volume: 11 start-page: 91 year: 1983 end-page: 95 ident: bib0035 article-title: A heuristic algorithm for the publication-title: OMEGA: The International Journal of Management Science – start-page: 433 year: 2016 end-page: 436 ident: bib0047 article-title: Optil.io: Cloud based platform for solving optimization problems using crowdsourcing approach publication-title: Proceedings of the 19th ACM conference on computer supported cooperative work and social computing companion, CSCW ’16 companion – start-page: 507 year: 2011 end-page: 523) ident: bib0018 article-title: Sequential model-based optimization for general algorithm configuration publication-title: Proceedings of the 5th international conference on learning and intelligent optimization: LION – volume: 16 start-page: 861 year: 2012 end-page: 875 ident: bib0025 article-title: The automatic design of multiobjective ant colony optimization algorithms publication-title: IEEE Transactions on Evolutionary Computation – volume: 39 start-page: 359 year: 1988 end-page: 364 ident: bib0014 article-title: Two-stage, hybrid flowshop scheduling problem publication-title: Journal of the Operational Research Society – year: 2010 ident: bib0001 article-title: Experimental methods for the analysis of optimization algorithms – volume: 16 start-page: 406 year: 2012 end-page: 417 ident: bib0004 article-title: Grammatical evolution of local search heuristics publication-title: IEEE Transactions on Evolutionary Computation – volume: 1 start-page: 61 year: 1954 end-page: 68 ident: bib0020 article-title: Optimal two- and three-stage production schedules with setup times included publication-title: Naval Research Logistics Quarterly – volume: 19 start-page: 93 year: 2014 end-page: 101 ident: bib0030 article-title: Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan publication-title: Applied Soft Computing – volume: 65 start-page: 466 year: 2013 end-page: 474 ident: bib0003 article-title: Parallel tabu search algorithm for the hybrid flow shop problem publication-title: Computers & Industrial Engineering – volume: 74 year: 2009 ident: bib0044 article-title: Metaheuristics: from design to implementation – start-page: 363 year: 2010 end-page: 397 ident: bib0028 article-title: Iterated local search: Framework and applications publication-title: Handbook of metaheuristics – volume: 30 start-page: 604 year: 2015 end-page: 613 ident: bib0009 article-title: An improved iterated greedy algorithm with a tabu-based reconstruction strategy for the no-wait flowshop scheduling problem publication-title: Applied Soft Computing – volume: 13 start-page: 3729 year: 2013 end-page: 3736 ident: bib0007 article-title: An immunoglobulin-based artificial immune system for solving the hybrid flow shop problem publication-title: Applied Soft Computing – volume: 45 start-page: 1409 year: 2013 end-page: 1430 ident: bib0048 article-title: An effective shuffled frog-leaping algorithm for solving the hybrid flow-shop scheduling problem with identical parallel machines publication-title: Engineering Optimization – volume: 10 start-page: 357 year: 2004 end-page: 380 ident: bib0005 article-title: ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics publication-title: Journal of Heuristics – volume: 24 start-page: 63 year: 2014 end-page: 77 ident: bib0023 article-title: A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem publication-title: Applied Soft Computing – volume: 232 start-page: 20 year: 2016 end-page: 42 ident: bib0022 article-title: SATenstein: Automatically building local search SAT solvers from components publication-title: Artificial Intelligence – volume: 148 start-page: 248 year: 2015 end-page: 259 ident: bib0008 article-title: An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems publication-title: Neurocomputing – year: 2012 ident: bib0034 article-title: Design and analysis of experiments – volume: 22 start-page: 3 year: 2015 end-page: 18 ident: bib0042 article-title: Metaheuristics – The metaphor exposed publication-title: International Transactions in Operational Research – volume: 177 start-page: 2033 issue: 3 year: 2007 ident: 10.1016/j.ejor.2019.10.004_bib0040 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.12.009 – volume: 232 start-page: 20 year: 2016 ident: 10.1016/j.ejor.2019.10.004_bib0022 article-title: SATenstein: Automatically building local search SAT solvers from components publication-title: Artificial Intelligence doi: 10.1016/j.artint.2015.11.002 – volume: 5 start-page: 15 issue: 1 year: 2013 ident: 10.1016/j.ejor.2019.10.004_bib0031 article-title: Solving hybrid flow shop scheduling problems using bat algorithm publication-title: International Journal of Logistics Economics and Globalisation doi: 10.1504/IJLEG.2013.054428 – volume: 80 start-page: 50 year: 2017 ident: 10.1016/j.ejor.2019.10.004_bib0037 article-title: Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows publication-title: Computers & Operations Research doi: 10.1016/j.cor.2016.11.022 – volume: 1 start-page: 61 issue: 1 year: 1954 ident: 10.1016/j.ejor.2019.10.004_bib0020 article-title: Optimal two- and three-stage production schedules with setup times included publication-title: Naval Research Logistics Quarterly doi: 10.1002/nav.3800010110 – volume: 68 start-page: 2043 issue: 9 year: 2013 ident: 10.1016/j.ejor.2019.10.004_bib0046 article-title: An enhanced estimation of distribution algorithm for solving hybrid flow-shop scheduling problem with identical parallel machines publication-title: The International Journal of Advanced Manufacturing Technology doi: 10.1007/s00170-013-4819-y – volume: 51 start-page: 190 year: 2014 ident: 10.1016/j.ejor.2019.10.004_bib0033 article-title: Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools publication-title: Computers & Operations Research doi: 10.1016/j.cor.2014.05.020 – volume: 22 start-page: 3 issue: 1 year: 2015 ident: 10.1016/j.ejor.2019.10.004_bib0042 article-title: Metaheuristics – The metaphor exposed publication-title: International Transactions in Operational Research doi: 10.1111/itor.12001 – start-page: 507 year: 2011 ident: 10.1016/j.ejor.2019.10.004_sbref0018 article-title: Sequential model-based optimization for general algorithm configuration – start-page: 363 year: 2010 ident: 10.1016/j.ejor.2019.10.004_sbref0028 article-title: Iterated local search: Framework and applications – volume: 39 start-page: 359 issue: 4 year: 1988 ident: 10.1016/j.ejor.2019.10.004_bib0014 article-title: Two-stage, hybrid flowshop scheduling problem publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1988.63 – volume: 65 start-page: 466 issue: 3 year: 2013 ident: 10.1016/j.ejor.2019.10.004_bib0003 article-title: Parallel tabu search algorithm for the hybrid flow shop problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2013.04.007 – start-page: 144 year: 2013 ident: 10.1016/j.ejor.2019.10.004_sbref0032 article-title: Automatic design of hybrid stochastic local search algorithms – volume: 103 start-page: 129 issue: 1 year: 1997 ident: 10.1016/j.ejor.2019.10.004_bib0039 article-title: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(96)00273-1 – start-page: 433 year: 2016 ident: 10.1016/j.ejor.2019.10.004_bib0047 article-title: Optil.io: Cloud based platform for solving optimization problems using crowdsourcing approach – volume: 169 start-page: 699 issue: 3 year: 2006 ident: 10.1016/j.ejor.2019.10.004_bib0015 article-title: Flowshop scheduling research after five decades publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.02.001 – volume: 19 start-page: 93 year: 2014 ident: 10.1016/j.ejor.2019.10.004_bib0030 article-title: Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2014.02.005 – volume: 10 start-page: 357 issue: 3 year: 2004 ident: 10.1016/j.ejor.2019.10.004_bib0005 article-title: ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics publication-title: Journal of Heuristics doi: 10.1023/B:HEUR.0000026900.92269.ec – year: 2014 ident: 10.1016/j.ejor.2019.10.004_bib0012 – start-page: 541 year: 2019 ident: 10.1016/j.ejor.2019.10.004_bib0043 article-title: Automated design of metaheuristic algorithms – volume: 16 start-page: 406 issue: 3 year: 2012 ident: 10.1016/j.ejor.2019.10.004_bib0004 article-title: Grammatical evolution of local search heuristics publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2011.2160401 – volume: 30 start-page: 604 year: 2015 ident: 10.1016/j.ejor.2019.10.004_bib0009 article-title: An improved iterated greedy algorithm with a tabu-based reconstruction strategy for the no-wait flowshop scheduling problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2015.02.006 – volume: 205 start-page: 1 issue: 1 year: 2010 ident: 10.1016/j.ejor.2019.10.004_bib0041 article-title: The hybrid flow shop scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2009.09.024 – year: 2012 ident: 10.1016/j.ejor.2019.10.004_bib0034 – volume: 13 start-page: 3729 issue: 8 year: 2013 ident: 10.1016/j.ejor.2019.10.004_bib0007 article-title: An immunoglobulin-based artificial immune system for solving the hybrid flow shop problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2013.03.006 – volume: 217 start-page: 8248 issue: 21 year: 2011 ident: 10.1016/j.ejor.2019.10.004_bib0016 article-title: Bounding strategies for the hybrid flow shop scheduling problem publication-title: Applied Mathematics and Computation doi: 10.1016/j.amc.2011.02.108 – volume: 148 start-page: 248 year: 2015 ident: 10.1016/j.ejor.2019.10.004_bib0008 article-title: An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems publication-title: Neurocomputing doi: 10.1016/j.neucom.2013.07.056 – volume: 36 start-page: 267 year: 2009 ident: 10.1016/j.ejor.2019.10.004_bib0019 article-title: ParamILS: An automatic algorithm configuration framework publication-title: Journal of Artificial Intelligence Research doi: 10.1613/jair.2861 – volume: 23 start-page: 765 issue: 5 year: 2010 ident: 10.1016/j.ejor.2019.10.004_bib0021 article-title: A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop publication-title: Engineering Applications of Artificial Intelligence doi: 10.1016/j.engappai.2010.01.008 – volume: 24 start-page: 63 year: 2014 ident: 10.1016/j.ejor.2019.10.004_bib0023 article-title: A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2014.07.005 – volume: 18 start-page: 301 issue: 2 year: 2014 ident: 10.1016/j.ejor.2019.10.004_bib0029 article-title: A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2013.2240304 – volume: 11 start-page: 91 issue: 1 year: 1983 ident: 10.1016/j.ejor.2019.10.004_bib0035 article-title: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem publication-title: OMEGA: The International Journal of Management Science doi: 10.1016/0305-0483(83)90088-9 – volume: 33 start-page: 117 issue: 2 year: 1999 ident: 10.1016/j.ejor.2019.10.004_bib0045 article-title: Les problemes d’ordonnancement de type flow-shop hybride: Etat de l’art publication-title: RAIRO Recherche Operationnelle doi: 10.1051/ro:1999108 – year: 2010 ident: 10.1016/j.ejor.2019.10.004_bib0001 article-title: Experimental methods for the analysis of optimization algorithms – volume: 12 start-page: 1755 issue: 6 year: 2012 ident: 10.1016/j.ejor.2019.10.004_bib0024 article-title: An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2012.01.011 – year: 2017 ident: 10.1016/j.ejor.2019.10.004_sbref0027 article-title: Automatic design of hybrid metaheuristics from algorithmic components – volume: 81 start-page: 160 year: 2017 ident: 10.1016/j.ejor.2019.10.004_bib0011 article-title: An iterated greedy algorithm with optimization of partial solutions for the permutation flowshop problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2016.12.021 – volume: 34 start-page: 1 issue: 1 year: 2000 ident: 10.1016/j.ejor.2019.10.004_bib0006 article-title: An exact method for solving the multi-processor flow-shop publication-title: RAIRO – Operations Research doi: 10.1051/ro:2000103 – volume: 16 start-page: 861 issue: 6 year: 2012 ident: 10.1016/j.ejor.2019.10.004_bib0025 article-title: The automatic design of multiobjective ant colony optimization algorithms publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2011.2182651 – volume: 3 start-page: 43 year: 2016 ident: 10.1016/j.ejor.2019.10.004_bib0026 article-title: The irace package: Iterated racing for automatic algorithm configuration publication-title: Operations Research Perspectives doi: 10.1016/j.orp.2016.09.002 – volume: 38 start-page: 1219 issue: 8 year: 2011 ident: 10.1016/j.ejor.2019.10.004_bib0010 article-title: A hybrid TP + PLS algorithm for bi-objective flow-shop scheduling problems publication-title: Computers & Operations Research doi: 10.1016/j.cor.2010.10.008 – start-page: 1341 year: 2016 ident: 10.1016/j.ejor.2019.10.004_bib0013 article-title: Exploration of metaheuristics through automatic algorithm configuration techniques and algorithmic frameworks – volume: 277 start-page: 643 year: 2014 ident: 10.1016/j.ejor.2019.10.004_bib0036 article-title: An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation publication-title: Information Sciences doi: 10.1016/j.ins.2014.02.152 – volume: 74 year: 2009 ident: 10.1016/j.ejor.2019.10.004_bib0044 – year: 2004 ident: 10.1016/j.ejor.2019.10.004_bib0017 – volume: 45 start-page: 1409 issue: 12 year: 2013 ident: 10.1016/j.ejor.2019.10.004_bib0048 article-title: An effective shuffled frog-leaping algorithm for solving the hybrid flow-shop scheduling problem with identical parallel machines publication-title: Engineering Optimization doi: 10.1080/0305215X.2012.737784 – volume: 45 start-page: 42 year: 2014 ident: 10.1016/j.ejor.2019.10.004_bib0038 article-title: A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation publication-title: OMEGA: The International Journal of Management Science doi: 10.1016/j.omega.2013.12.004 – volume: 761 start-page: 83 year: 2018 ident: 10.1016/j.ejor.2019.10.004_bib0002 article-title: Local optima networks in solving algorithm selection problem for TSP doi: 10.1007/978-3-319-91446-6_9 |
| SSID | ssj0001515 |
| Score | 2.4839838 |
| Snippet | •We present an Automatic Algorithm Design system for the hybrid flowshop problem.•Algorithm components are combined according to a grammar to generate new... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 835 |
| SubjectTerms | Automatic algorithm configuration Automatic Algorithm Design Hybrid flowshop Scheduling |
| Title | Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems |
| URI | https://dx.doi.org/10.1016/j.ejor.2019.10.004 |
| Volume | 282 |
| WOSCitedRecordID | wos000513985000003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9tAEF5MUkp76MNtafpiD70FBT1Wjz0qISbtIZiSgm9ivSs1MapkZDkP_53-0c4-LdImNIeCEWaRVrbn88yn2ZlvEfocsnlaVUHihVHKPFLFzKOCCK9kPuUQT2JGudpsIj09zWYzOh2NftlemMs6bZrs-pou_6upYQyMLVtnH2BuNykMwHswOhzB7HD8J8Pn677VOqx5_aOFZ__zn-BVZJ2GKik8uZE9WvuTur1anbdLKcMJ0UY1pU_15jKrO7P1hrnCQGdziEYsyCWV87piXevJ9LRagw9cjroUXeuWd9YXavDbeq5X6h1Ep7Lyb7NRNQYTKXQBSHVZoF6efHjUb3QN9KC4yeQtQn9bJWj7tdLUC0PduWl9cZiFA9BFA8-aaVUTG6S1BuUf_l-nIhYH5aKVYq8BPVCle2Qb7ewK_60g6EoTbdXbopBzFHIOGCiU5uxumMYUXOdu_uV49tUFfMkJ1WKV-UKmN0uXEd7-JH_nPwNOc_YCPTMPIzjXIHqJRmUzRo9tL8QYPbd7fmATAsbo6UDA8hU6dGDDDmxYgw0D2LAGG7Zgw1uwYQu21-j75Pjs6MQzu3J4nPi09wjPSCV5ZMUyvwSGOacEaCQwPebzecR4KeKQlVmZkCTJEgHUKOWxiOKAVXEWBNEbtNO0TfkW4agSBFwEV0mGWHAGL84YSSmLufDFHgrsb1VwI1kvd06pi7uttIf23TVLLdhy79mxNUFhKKemkgUg6p7r3j3oLu_Rk-0_4APa6bt1-RE94pf9xar7ZOD0G4N_orQ |
| linkProvider | Elsevier |
| 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=Automatic+Algorithm+Design+for+Hybrid+Flowshop+Scheduling+Problems&rft.jtitle=European+journal+of+operational+research&rft.au=Alfaro-Fern%C3%A1ndez%2C+Pedro&rft.au=Ruiz%2C+Rub%C3%A9n&rft.au=Pagnozzi%2C+Federico&rft.au=St%C3%BCtzle%2C+Thomas&rft.date=2020-05-01&rft.issn=0377-2217&rft.volume=282&rft.issue=3&rft.spage=835&rft.epage=845&rft_id=info:doi/10.1016%2Fj.ejor.2019.10.004&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2019_10_004 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |