An improved iterated greedy algorithm for the energy-efficient blocking hybrid flow shop scheduling problem
•A mathematical model of a blocking hybrid flow shop scheduling problem with energy consumption criteria is proposed.•A simple global perturbation based on a half-swap operator is proposed to further search for the potentially best solution.•A local perturbation strategy based on a swap operator is...
Gespeichert in:
| Veröffentlicht in: | Swarm and evolutionary computation Jg. 69; S. 100992 |
|---|---|
| Hauptverfasser: | , , , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.03.2022
|
| Schlagworte: | |
| ISSN: | 2210-6502 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | •A mathematical model of a blocking hybrid flow shop scheduling problem with energy consumption criteria is proposed.•A simple global perturbation based on a half-swap operator is proposed to further search for the potentially best solution.•A local perturbation strategy based on a swap operator is designed to ensure the convergence of the algorithm.•The proposed algorithm is applied to 140 test instances with different scales and compared with state-of-the-art algorithms and can obtain the best solution to the BHFSP.
With the continuous development of national economies, problems of various energy consumption levels and pollution emissions in manufacturing have attracted attention from researchers. Most existing research has focused on reducing economic costs and energy consumption. However, the Hybrid Flow Shop Scheduling Problem with energy-efficient criteria has not yet been well studied, especially with blocking constraints. This paper is the first to present a mathematical model of the blocking hybrid flow shop problem with an energy-efficient criterion and a modified Iterative Greedy algorithm based on a swap strategy designed to optimize the constructed model. In the proposed algorithm, first, a heuristic is adopted to generate the initial solution. Second, a local perturbation strategy based on a swap operator is designed to ensure the convergence of the algorithm. Third, a simple global perturbation strategy based on a half-swap operator is proposed as a means to further search for the potentially best solution with the traditional simulated annealing criterion. The proposed algorithm is applied to 150 test instances at different scales and compared to state-of-the-art algorithms. The experimental results demonstrate that the proposed algorithm outperforms the compared algorithms and can obtain a better solution. |
|---|---|
| AbstractList | •A mathematical model of a blocking hybrid flow shop scheduling problem with energy consumption criteria is proposed.•A simple global perturbation based on a half-swap operator is proposed to further search for the potentially best solution.•A local perturbation strategy based on a swap operator is designed to ensure the convergence of the algorithm.•The proposed algorithm is applied to 140 test instances with different scales and compared with state-of-the-art algorithms and can obtain the best solution to the BHFSP.
With the continuous development of national economies, problems of various energy consumption levels and pollution emissions in manufacturing have attracted attention from researchers. Most existing research has focused on reducing economic costs and energy consumption. However, the Hybrid Flow Shop Scheduling Problem with energy-efficient criteria has not yet been well studied, especially with blocking constraints. This paper is the first to present a mathematical model of the blocking hybrid flow shop problem with an energy-efficient criterion and a modified Iterative Greedy algorithm based on a swap strategy designed to optimize the constructed model. In the proposed algorithm, first, a heuristic is adopted to generate the initial solution. Second, a local perturbation strategy based on a swap operator is designed to ensure the convergence of the algorithm. Third, a simple global perturbation strategy based on a half-swap operator is proposed as a means to further search for the potentially best solution with the traditional simulated annealing criterion. The proposed algorithm is applied to 150 test instances at different scales and compared to state-of-the-art algorithms. The experimental results demonstrate that the proposed algorithm outperforms the compared algorithms and can obtain a better solution. |
| ArticleNumber | 100992 |
| Author | Han, Yu-Yan Zhang, Biao Meng, Lei-Lei Liu, Yi-Ping Pan, Quan-Ke Qin, Hao-Xiang Gong, Dun-Wei |
| Author_xml | – sequence: 1 givenname: Hao-Xiang surname: Qin fullname: Qin, Hao-Xiang organization: School of Computer Science, Liaocheng University, Liaocheng 252059, China – sequence: 2 givenname: Yu-Yan orcidid: 0000-0001-8963-5421 surname: Han fullname: Han, Yu-Yan email: hanyuyan@lcu-cs.com organization: School of Computer Science, Liaocheng University, Liaocheng 252059, China – sequence: 3 givenname: Biao surname: Zhang fullname: Zhang, Biao organization: School of Computer Science, Liaocheng University, Liaocheng 252059, China – sequence: 4 givenname: Lei-Lei orcidid: 0000-0003-1439-4832 surname: Meng fullname: Meng, Lei-Lei organization: School of Computer Science, Liaocheng University, Liaocheng 252059, China – sequence: 5 givenname: Yi-Ping surname: Liu fullname: Liu, Yi-Ping organization: The College of Computer Science and Electronic Engineering, Hunan University, 410082, China – sequence: 6 givenname: Quan-Ke surname: Pan fullname: Pan, Quan-Ke organization: School of Mechatronic Engineering and Automation, Shanghai University, Shanghai 200072, China – sequence: 7 givenname: Dun-Wei surname: Gong fullname: Gong, Dun-Wei organization: School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China |
| BookMark | eNqFkD1PwzAQhj0UiVL6C1j8B1JsBydkYKgqvqRKLDBb_jgnbpO4sk2r_HsSysQAt9zpTs9J73OFZr3vAaEbSlaU0OJ2t4onOPoVI4yOG1JVbIbmjFGSFZywS7SMcUfGKgjjvJqj_brHrjsEfwSDXYIg0zjUAcAMWLa1Dy41HbY-4NQAhh5CPWRgrdMO-oRV6_Xe9TVuBhWcwbb1Jxwbf8BRN2A-2-k2vlctdNfowso2wvKnL9DH0-P75iXbvj2_btbbTOckT1luLLeUFZqo6k5V0paKEdC8VCWjWhtglNuS8PuKSjD5GIZqSQ21XOUlWJUvUHX-q4OPMYAV2iWZnO9TkK4VlIhJltiJb1likiXOskY2_8UegutkGP6hHs4UjLGODoKIkx4NxgXQSRjv_uS_APQxi8o |
| CitedBy_id | crossref_primary_10_1016_j_cie_2024_110635 crossref_primary_10_3390_math11112453 crossref_primary_10_1080_00207543_2023_2253925 crossref_primary_10_1016_j_ijhydene_2024_08_048 crossref_primary_10_3233_JIFS_241796 crossref_primary_10_1109_TCYB_2022_3192112 crossref_primary_10_1109_ACCESS_2023_3293029 crossref_primary_10_1016_j_engappai_2024_109915 crossref_primary_10_1016_j_asoc_2024_111254 crossref_primary_10_1016_j_asoc_2025_113475 crossref_primary_10_3934_jimo_2025150 crossref_primary_10_1038_s41598_022_19215_3 crossref_primary_10_1155_2022_5056356 crossref_primary_10_3390_pr12010051 crossref_primary_10_1016_j_cor_2025_107267 crossref_primary_10_1080_00207543_2023_2254858 crossref_primary_10_1016_j_jii_2022_100412 crossref_primary_10_3390_math11010077 crossref_primary_10_1016_j_eswa_2024_125026 crossref_primary_10_1007_s42524_022_0242_0 crossref_primary_10_1016_j_eswa_2024_123924 crossref_primary_10_1016_j_eswa_2023_120909 crossref_primary_10_1109_TSMC_2024_3358383 crossref_primary_10_1016_j_ejor_2023_05_010 crossref_primary_10_1080_00207543_2023_2279145 crossref_primary_10_1016_j_eswa_2023_119805 crossref_primary_10_1109_TCYB_2022_3151855 crossref_primary_10_1016_j_swevo_2024_101544 crossref_primary_10_1007_s11081_024_09911_6 crossref_primary_10_1016_j_ress_2024_109990 crossref_primary_10_1007_s11227_024_06713_6 crossref_primary_10_3390_sym15040836 crossref_primary_10_1016_j_ejor_2025_04_037 crossref_primary_10_1016_j_eswa_2025_129536 crossref_primary_10_1016_j_asoc_2022_109504 crossref_primary_10_1016_j_asoc_2025_113093 crossref_primary_10_1109_TEVC_2023_3312769 crossref_primary_10_1016_j_knosys_2022_109962 crossref_primary_10_1016_j_engappai_2022_105418 crossref_primary_10_1016_j_matcom_2025_02_026 crossref_primary_10_2478_jaiscr_2024_0006 crossref_primary_10_1016_j_eswa_2023_120846 crossref_primary_10_1016_j_jmsy_2024_10_019 crossref_primary_10_1016_j_swevo_2024_101537 crossref_primary_10_3390_pr10101944 crossref_primary_10_1016_j_dsp_2024_104908 crossref_primary_10_1016_j_ejor_2025_07_055 crossref_primary_10_1016_j_swevo_2024_101696 crossref_primary_10_1109_TETCI_2023_3271331 crossref_primary_10_1080_00207543_2024_2383781 crossref_primary_10_1049_cim2_12099 crossref_primary_10_1109_TII_2022_3220860 crossref_primary_10_1016_j_eswa_2024_124874 crossref_primary_10_1038_s41598_024_80785_5 crossref_primary_10_1109_ACCESS_2023_3276871 crossref_primary_10_3390_sym16020203 crossref_primary_10_1016_j_procs_2024_09_165 crossref_primary_10_1016_j_swevo_2022_101129 crossref_primary_10_1016_j_cie_2025_111330 crossref_primary_10_1109_ACCESS_2023_3234428 crossref_primary_10_1016_j_knosys_2025_113424 crossref_primary_10_1016_j_eswa_2023_119548 crossref_primary_10_1016_j_cor_2023_106224 crossref_primary_10_1016_j_eswa_2023_121667 crossref_primary_10_1080_0305215X_2024_2372630 crossref_primary_10_1016_j_eswa_2023_120571 crossref_primary_10_1016_j_dajour_2025_100609 crossref_primary_10_1016_j_eswa_2023_122594 crossref_primary_10_1016_j_eswa_2024_125244 crossref_primary_10_1080_23311916_2023_2206074 |
| Cites_doi | 10.3390/su11010179 10.1016/j.eswa.2018.12.039 10.1016/j.knosys.2020.105527 10.1016/j.engappai.2018.11.005 10.1016/j.promfg.2020.02.051 10.1016/0305-0483(83)90088-9 10.1007/s00170-013-5265-6 10.1016/j.knosys.2018.02.029 10.1016/j.eswa.2015.03.012 10.1109/TSM.2003.811890 10.1016/j.swevo.2020.100742 10.1080/00207543.2014.949363 10.1109/TCYB.2017.2771213 10.1016/j.asoc.2015.02.006 10.1016/j.asoc.2014.07.005 10.1016/j.cor.2019.06.009 10.1016/j.cor.2016.07.002 10.1287/opre.37.6.925 10.1057/palgrave.jors.2602033 10.1109/TCYB.2018.2796119 10.1016/j.engappai.2018.09.005 10.1016/j.apm.2013.06.005 10.1016/j.omega.2010.07.007 10.1016/j.ejor.2005.12.009 10.1016/j.jclepro.2019.03.155 10.1016/j.eswa.2010.08.139 10.1016/j.asoc.2016.12.021 10.1016/j.cor.2005.03.028 10.1016/j.asoc.2019.105701 10.1016/j.ejor.2016.09.055 10.1109/TSMC.2018.2830792 10.1016/j.cor.2013.01.018 10.1016/j.omega.2013.12.004 10.1016/j.procs.2019.12.208 10.17562/PB-53-10 10.1016/S0925-5273(03)00065-3 10.1057/palgrave.jors.2602625 10.1016/j.cie.2018.05.056 10.1016/j.cor.2013.02.003 |
| ContentType | Journal Article |
| Copyright | 2021 Elsevier B.V. |
| Copyright_xml | – notice: 2021 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.swevo.2021.100992 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | 10_1016_j_swevo_2021_100992 S2210650221001541 |
| 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-3df5f126c0b94b9af7b20ec57b721ccde215f705891aed30001ca1d1f5b37efb3 |
| ISICitedReferencesCount | 86 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000782991200006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2210-6502 |
| IngestDate | Tue Nov 18 20:45:14 EST 2025 Wed Nov 05 20:41:51 EST 2025 Fri Feb 23 02:44:09 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Blocking Local perturbation Iterated greedy algorithm Energy efficiency Hybrid flow shop scheduling problem |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c303t-3df5f126c0b94b9af7b20ec57b721ccde215f705891aed30001ca1d1f5b37efb3 |
| ORCID | 0000-0001-8963-5421 0000-0003-1439-4832 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_swevo_2021_100992 crossref_primary_10_1016_j_swevo_2021_100992 elsevier_sciencedirect_doi_10_1016_j_swevo_2021_100992 |
| PublicationCentury | 2000 |
| PublicationDate | March 2022 2022-03-00 |
| PublicationDateYYYYMMDD | 2022-03-01 |
| PublicationDate_xml | – month: 03 year: 2022 text: March 2022 |
| PublicationDecade | 2020 |
| PublicationTitle | Swarm and evolutionary computation |
| PublicationYear | 2022 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Tang, Xuan, Liu (bib0027) 2006; 33 Zhang, Pan, Gao (bib0031) 2017; 52 Ochi, Driss (bib0040) 2019; 164 Ribas, Companys, Tort-Martorell (bib0018) 2011; 39 Han, Gong, Jin (bib0011) 2019; 49 Nejati, Mahdavi, Hassanzadeh (bib0029) 2014; 70 Gong, Han, Sun (bib0010) 2018; 148 Pan, Wang, Li (bib0030) 2014; 45 Toumi, Jarboui, Eddaly (bib0021) 2013; 40 Huang, Pan, Gao (bib0038) 2020 Wang, Liu, Chu (bib0024) 2015; 53 Shao, Shao, Pi (bib0044) 2020 Ztop, Tasgetiren, Türsel Eliiyi (bib0046) 2019; 111 Shao, Pi, Shao (bib0015) 2019; 78 Nawaz, Enscore, Ham (bib0022) 1983; 11 Kim, Shim, Choi (bib0005) 2003; 16 FattahiP, JolaiF (bib0025) 2014; 38 Fernandez-Viagas, Ruiz, Framinan (bib0002) 2016; 257 Rolf, Reggelin, Nahhas (bib0009) 2020; 42 Liu, Pei, Cheng (bib0033) 2019; 84 Tasgetiren, Kizilay, Pan (bib0012) 2017; 77 Tang, Xuan (bib0026) 2006; 57 Ying (bib0042) 2009; 60 Ding, Chiong (bib0037) 2015; 30 Choi, Kim, Lee (bib0004) 2011; 38 Zhao, Xue, Zhang (bib0016) 2019; 49 Fernandez-Viagas, Valente, Framinan (bib0039) 2017 Rodriguez, Lozano, Blum (bib0043) 2013; 40 Marichelvam, Geetha, Tosun (bib0034) 2019; 114 Ribas, Companys, Tort-Martorell (bib0013) 2019; 121 Wang, Wang (bib0001) 2018 Huang, Pan, Huang (bib0041) 2020; 152 Shao, Pi, Shao (bib0014) 2019; 145 Ruiz, Stützle (bib0017) 2007; 177 Jun, Park (bib0006) 2015; 42 Zhang, Wu, Peng (bib0035) 2018; 11 Osaba, Villar-Rodriguez, Del Ser, Nebro, Molina, LaTorre, Suganthan, Coello Coello, Molina (bib0047) 2021; 100888 Lei, Li, Wang (bib0036) 2019; 49 Schulz, Neufeld, Buscher (bib0008) 2019; 224 Nouri, Ladhari (bib0019) 2016; 53 Ronconi (bib0020) 2004; 87 Tao, Li, Huang (bib0028) 2020 Peng, Pan, Gao (bib0003) 2018; 122 Li, Pan, Wang (bib0032) 2014; 24 McCormick, Pinedo, Shenker, Wolf (bib0023) 1989; 37 Fbo, Ms (bib0045) 2020 Zhang, Xing, Cao (bib0007) 2018; 76 Fernandez-Viagas (10.1016/j.swevo.2021.100992_bib0002) 2016; 257 Ochi (10.1016/j.swevo.2021.100992_bib0040) 2019; 164 Lei (10.1016/j.swevo.2021.100992_bib0036) 2019; 49 Ztop (10.1016/j.swevo.2021.100992_bib0046) 2019; 111 Rolf (10.1016/j.swevo.2021.100992_bib0009) 2020; 42 Schulz (10.1016/j.swevo.2021.100992_bib0008) 2019; 224 FattahiP (10.1016/j.swevo.2021.100992_bib0025) 2014; 38 Ribas (10.1016/j.swevo.2021.100992_bib0013) 2019; 121 Zhang (10.1016/j.swevo.2021.100992_bib0031) 2017; 52 Zhang (10.1016/j.swevo.2021.100992_bib0007) 2018; 76 Pan (10.1016/j.swevo.2021.100992_bib0030) 2014; 45 Nawaz (10.1016/j.swevo.2021.100992_bib0022) 1983; 11 Li (10.1016/j.swevo.2021.100992_bib0032) 2014; 24 Ding (10.1016/j.swevo.2021.100992_bib0037) 2015; 30 Peng (10.1016/j.swevo.2021.100992_bib0003) 2018; 122 Shao (10.1016/j.swevo.2021.100992_bib0015) 2019; 78 Shao (10.1016/j.swevo.2021.100992_bib0044) 2020 Tang (10.1016/j.swevo.2021.100992_bib0026) 2006; 57 Ruiz (10.1016/j.swevo.2021.100992_bib0017) 2007; 177 Ribas (10.1016/j.swevo.2021.100992_bib0018) 2011; 39 Toumi (10.1016/j.swevo.2021.100992_bib0021) 2013; 40 McCormick (10.1016/j.swevo.2021.100992_bib0023) 1989; 37 Osaba (10.1016/j.swevo.2021.100992_bib0047) 2021; 100888 Huang (10.1016/j.swevo.2021.100992_bib0041) 2020; 152 Tasgetiren (10.1016/j.swevo.2021.100992_bib0012) 2017; 77 Wang (10.1016/j.swevo.2021.100992_bib0001) 2018 Wang (10.1016/j.swevo.2021.100992_bib0024) 2015; 53 Zhang (10.1016/j.swevo.2021.100992_bib0035) 2018; 11 Jun (10.1016/j.swevo.2021.100992_bib0006) 2015; 42 Choi (10.1016/j.swevo.2021.100992_bib0004) 2011; 38 Kim (10.1016/j.swevo.2021.100992_bib0005) 2003; 16 Nejati (10.1016/j.swevo.2021.100992_bib0029) 2014; 70 Rodriguez (10.1016/j.swevo.2021.100992_bib0043) 2013; 40 Marichelvam (10.1016/j.swevo.2021.100992_bib0034) 2019; 114 Ying (10.1016/j.swevo.2021.100992_bib0042) 2009; 60 Nouri (10.1016/j.swevo.2021.100992_bib0019) 2016; 53 Han (10.1016/j.swevo.2021.100992_bib0011) 2019; 49 Fbo (10.1016/j.swevo.2021.100992_bib0045) 2020 Tao (10.1016/j.swevo.2021.100992_bib0028) 2020 Zhao (10.1016/j.swevo.2021.100992_bib0016) 2019; 49 Fernandez-Viagas (10.1016/j.swevo.2021.100992_bib0039) 2017 Huang (10.1016/j.swevo.2021.100992_bib0038) 2020 Gong (10.1016/j.swevo.2021.100992_bib0010) 2018; 148 Liu (10.1016/j.swevo.2021.100992_bib0033) 2019; 84 Shao (10.1016/j.swevo.2021.100992_bib0014) 2019; 145 Ronconi (10.1016/j.swevo.2021.100992_bib0020) 2004; 87 Tang (10.1016/j.swevo.2021.100992_bib0027) 2006; 33 |
| References_xml | – volume: 84 year: 2019 ident: bib0033 article-title: Two-stage hybrid flow shop scheduling on parallel batching machines considering a job-dependent deteriorating effect and non-identical job sizes publication-title: Appl. Soft Comput. – year: 2020 ident: bib0044 article-title: Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem publication-title: Knowl. Based Syst. – volume: 100888 start-page: 1 year: 2021 end-page: 21 ident: bib0047 article-title: A tutorial on the design, experimentation and application of metaheuristic algorithms to real-world optimization problems publication-title: Swarm Evolut. Comput. – volume: 49 year: 2019 ident: bib0016 article-title: A discrete gravitational search algorithm for the blocking flow shop problem with total flow time minimization publication-title: Appl. Intell. – start-page: 1 year: 2020 end-page: 16 ident: bib0028 article-title: Discrete imperialist competitive algorithm for the resource-constrained hybrid flow shop problem with energy consumption publication-title: Complex Intell. Syst. – volume: 49 start-page: 184 year: 2019 end-page: 197 ident: bib0011 article-title: Evolutionary multiobjective blocking lot-streaming flow shop scheduling with machine breakdowns publication-title: IEEE Trans. Cybern. – volume: 224 start-page: 421 year: 2019 end-page: 434 ident: bib0008 article-title: A multi-objective iterated local search algorithm for comprehensive energy-aware hybrid flow shop scheduling publication-title: J. Clean. Prod. – volume: 78 start-page: 124 year: 2019 end-page: 141 ident: bib0015 article-title: An efficient discrete invasive weed optimization for blocking flow shop scheduling problem publication-title: Eng. Appl. Artif. Intell. – start-page: 125 year: 2020 ident: bib0045 article-title: Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flow shop scheduling problem with sequence dependent setup times: A case study at a manufacturing plant publication-title: Comput. Oper. Res. – volume: 111 start-page: 177 year: 2019 end-page: 196 ident: bib0046 article-title: Metaheuristic algorithms for the hybrid flow shop scheduling problem publication-title: Comput. Oper. Res. – volume: 77 start-page: 111 year: 2017 end-page: 126 ident: bib0012 article-title: Iterated greedy algorithms for the blocking flow shop scheduling problem with makespan criterion publication-title: Comput. Oper. Res. – volume: 39 start-page: 293 year: 2011 end-page: 301 ident: bib0018 article-title: An iterated greedy algorithm for the flow shop scheduling problem with blocking publication-title: Omega – volume: 40 start-page: 1829 year: 2013 end-page: 1841 ident: bib0043 article-title: An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem publication-title: Comput. Oper. Res. – start-page: 1 year: 2018 end-page: 15 ident: bib0001 article-title: A knowledge-based cooperative algorithm for energy-efficient scheduling of distributed flow-shop publication-title: IEEE Trans. Syst. Man Cybern. Syst. – volume: 145 year: 2019 ident: bib0014 article-title: Hybrid enhanced discrete fruit fly optimization algorithm for scheduling blocking flow-shop in distributed environment publication-title: Expert Syst. Appl. – volume: 87 start-page: 39 year: 2004 end-page: 48 ident: bib0020 article-title: A note on constructive heuristics for the flowshop problem with blocking publication-title: Int. J. Prod. Econ. – volume: 38 start-page: 3514 year: 2011 end-page: 3521 ident: bib0004 article-title: Real-time scheduling for reentrant hybrid flow shops: a decision tree based mechanism and its application to a TFT-LCD line publication-title: Expert Syst. Appl. – volume: 11 start-page: 91 year: 1983 end-page: 95 ident: bib0022 article-title: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem publication-title: Omega – volume: 11 year: 2018 ident: bib0035 article-title: An improved scheduling approach for minimizing total energy consumption and makespan in a flexible job shop environment publication-title: Sustainability – volume: 49 start-page: 1097 year: 2019 end-page: 1109 ident: bib0036 article-title: A two-phase meta-heuristic for multiobjective flexible job shop scheduling problem with total energy consumption threshold publication-title: IEEE Trans. Cybern. – volume: 30 start-page: 604 year: 2015 end-page: 613 ident: bib0037 article-title: An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flow shop scheduling problem publication-title: Appl. Soft Comput. – volume: 53 start-page: 91 year: 2016 end-page: 95 ident: bib0019 article-title: An efficient iterated greedy algorithm for the makespan blocking flow shop scheduling problem publication-title: Polibits – volume: 257 year: 2016 ident: bib0002 article-title: A new vision of approximate methods for the permutation flow shop to minimize makespan: State-of-the-art and computational evaluation publication-title: Eur. J. Oper. Res. – volume: 42 start-page: 6196 year: 2015 end-page: 6204 ident: bib0006 article-title: A hybrid genetic algorithm for the hybrid flow shop scheduling problem with nighttime work and simultaneous work constraints: a case study from the transformer industry publication-title: Expert Syst. Appl. – volume: 37 start-page: 925 year: 1989 end-page: 935 ident: bib0023 article-title: Sequencing in an assembly line with blocking to minimize cycle time publication-title: Oper. Res. – volume: 57 start-page: 316 year: 2006 end-page: 324 ident: bib0026 article-title: Lagrangian relaxation algorithms for real-time hybrid flow shop scheduling with finite intermediate buffers publication-title: J. Oper. Res. Soc. – volume: 24 start-page: 63 year: 2014 end-page: 77 ident: bib0032 article-title: A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem publication-title: Appl. Soft Comput. J. – volume: 114 year: 2019 ident: bib0034 article-title: An improved particle swarm optimization algorithm to solve hybrid flow shop scheduling problems with the effect of human factors - a case study publication-title: Comput. Oper. Res. – volume: 76 start-page: 96 year: 2018 end-page: 107 ident: bib0007 article-title: Discrete differential evolution algorithm for distributed blocking flow shop scheduling with makespan criterion publication-title: Eng. Appl. Artif. Intell. – volume: 33 start-page: 3344 year: 2006 end-page: 3359 ident: bib0027 article-title: A new Lagrangian relaxation algorithm for hybrid flow shop scheduling to minimize total weighted completion time publication-title: Comput. Oper. Res. – volume: 122 start-page: 235 year: 2018 end-page: 250 ident: bib0003 article-title: An improved artificial bee colony algorithm for real-world hybrid flow shop rescheduling in steelmaking-refining continuous casting process publication-title: Comput. Ind. Eng. – year: 2020 ident: bib0038 article-title: An effective iterated greedy method for the distributed permutation flow shop scheduling problem with sequence-dependent setup times publication-title: Swarm Evolut. Comput. – volume: 121 start-page: 347 year: 2019 end-page: 361 ident: bib0013 article-title: An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem publication-title: Expert Syst. Appl. – volume: 152 year: 2020 ident: bib0041 article-title: An improved iterated greedy algorithm for the distributed assembly permutation flow shop scheduling problem publication-title: Comput. Ind. Eng. – volume: 177 start-page: 2033 year: 2007 end-page: 2049 ident: bib0017 article-title: A simple and effective iterated greedy algorithm for the permutation flow shop scheduling problem publication-title: Eur. J. Oper. Res. – volume: 53 start-page: 1143 year: 2015 end-page: 1167 ident: bib0024 article-title: A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling publication-title: Int. J. Prod. Res. – volume: 164 start-page: 471 year: 2019 end-page: 477 ident: bib0040 article-title: Scheduling the distributed assembly flow shop problem to minimize the makespan publication-title: Procedia Comput. Sci. – volume: 42 start-page: 442 year: 2020 end-page: 449 ident: bib0009 article-title: Assigning dispatching rules using a genetic algorithm to solve a hybrid flow shop scheduling problem publication-title: Procedia Manuf. – volume: 45 start-page: 42 year: 2014 end-page: 56 ident: bib0030 article-title: A novel discrete artificial bee colony algorithm for the hybrid flow shop scheduling problem with makespan minimisation publication-title: Omega – volume: 52 start-page: 14 year: 2017 end-page: 27 ident: bib0031 article-title: An effective modified migrating birds optimization for hybrid flow shop scheduling problem with lot streaming publication-title: Appl. Soft Comput. – volume: 16 start-page: 290 year: 2003 end-page: 298 ident: bib0005 article-title: Simplification methods for accelerating simulation-based real-time scheduling in a semiconductor wafer fabrication facility publication-title: IEEE Trans. Semicond. Manuf. – volume: 148 start-page: 115 year: 2018 end-page: 130 ident: bib0010 article-title: A novel hybrid multi-objective artificial bee colony algorithm for blocking lot-streaming flow shop scheduling problems publication-title: Knowl. Based Syst. – volume: 70 start-page: 501 year: 2014 end-page: 514 ident: bib0029 article-title: Multi-job lot streaming to minimize the weighted completion time in a hybrid flow shop scheduling problem with work shift constraint publication-title: Int. J. Adv. Manuf. Technol. – year: 2017 ident: bib0039 article-title: Iterated-greedy-based algorithms with beam search initialization for the permutation flow shop to minimise total tardiness publication-title: Expert Syst. Appl. – volume: 40 start-page: 1874 year: 2013 end-page: 1883 ident: bib0021 article-title: Optimizing blocking flow shop scheduling problem with total completion time criterion publication-title: Comput. Oper. Res. – volume: 38 start-page: 119 year: 2014 end-page: 134 ident: bib0025 article-title: A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations publication-title: Appl. Math. Model. – volume: 60 start-page: 810 year: 2009 end-page: 817 ident: bib0042 article-title: An iterated greedy heuristic for multistage hybrid flow shop scheduling problems with multiprocessor tasks publication-title: J. Oper. Res. Soc. – volume: 11 issue: 1 year: 2018 ident: 10.1016/j.swevo.2021.100992_bib0035 article-title: An improved scheduling approach for minimizing total energy consumption and makespan in a flexible job shop environment publication-title: Sustainability doi: 10.3390/su11010179 – volume: 145 year: 2019 ident: 10.1016/j.swevo.2021.100992_bib0014 article-title: Hybrid enhanced discrete fruit fly optimization algorithm for scheduling blocking flow-shop in distributed environment publication-title: Expert Syst. Appl. – volume: 100888 start-page: 1 year: 2021 ident: 10.1016/j.swevo.2021.100992_bib0047 article-title: A tutorial on the design, experimentation and application of metaheuristic algorithms to real-world optimization problems publication-title: Swarm Evolut. Comput. – volume: 121 start-page: 347 year: 2019 ident: 10.1016/j.swevo.2021.100992_bib0013 article-title: An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2018.12.039 – year: 2020 ident: 10.1016/j.swevo.2021.100992_bib0044 article-title: Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem publication-title: Knowl. Based Syst. doi: 10.1016/j.knosys.2020.105527 – volume: 78 start-page: 124 issue: 2 year: 2019 ident: 10.1016/j.swevo.2021.100992_bib0015 article-title: An efficient discrete invasive weed optimization for blocking flow shop scheduling problem publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2018.11.005 – volume: 42 start-page: 442 year: 2020 ident: 10.1016/j.swevo.2021.100992_bib0009 article-title: Assigning dispatching rules using a genetic algorithm to solve a hybrid flow shop scheduling problem publication-title: Procedia Manuf. doi: 10.1016/j.promfg.2020.02.051 – volume: 11 start-page: 91 issue: 1 year: 1983 ident: 10.1016/j.swevo.2021.100992_bib0022 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: 70 start-page: 501 issue: 1-4 year: 2014 ident: 10.1016/j.swevo.2021.100992_bib0029 article-title: Multi-job lot streaming to minimize the weighted completion time in a hybrid flow shop scheduling problem with work shift constraint publication-title: Int. J. Adv. Manuf. Technol. doi: 10.1007/s00170-013-5265-6 – volume: 148 start-page: 115 issue: MAY15 year: 2018 ident: 10.1016/j.swevo.2021.100992_bib0010 article-title: A novel hybrid multi-objective artificial bee colony algorithm for blocking lot-streaming flow shop scheduling problems publication-title: Knowl. Based Syst. doi: 10.1016/j.knosys.2018.02.029 – volume: 42 start-page: 6196 issue: 15-16 year: 2015 ident: 10.1016/j.swevo.2021.100992_bib0006 article-title: A hybrid genetic algorithm for the hybrid flow shop scheduling problem with nighttime work and simultaneous work constraints: a case study from the transformer industry publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2015.03.012 – volume: 16 start-page: 290 issue: 2 year: 2003 ident: 10.1016/j.swevo.2021.100992_bib0005 article-title: Simplification methods for accelerating simulation-based real-time scheduling in a semiconductor wafer fabrication facility publication-title: IEEE Trans. Semicond. Manuf. doi: 10.1109/TSM.2003.811890 – year: 2020 ident: 10.1016/j.swevo.2021.100992_bib0038 article-title: An effective iterated greedy method for the distributed permutation flow shop scheduling problem with sequence-dependent setup times publication-title: Swarm Evolut. Comput. doi: 10.1016/j.swevo.2020.100742 – volume: 53 start-page: 1143 issue: 4 year: 2015 ident: 10.1016/j.swevo.2021.100992_bib0024 article-title: A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2014.949363 – volume: 49 start-page: 184 issue: 1 year: 2019 ident: 10.1016/j.swevo.2021.100992_bib0011 article-title: Evolutionary multiobjective blocking lot-streaming flow shop scheduling with machine breakdowns publication-title: IEEE Trans. Cybern. doi: 10.1109/TCYB.2017.2771213 – volume: 30 start-page: 604 year: 2015 ident: 10.1016/j.swevo.2021.100992_bib0037 article-title: An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flow shop scheduling problem publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2015.02.006 – volume: 24 start-page: 63 year: 2014 ident: 10.1016/j.swevo.2021.100992_bib0032 article-title: A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem publication-title: Appl. Soft Comput. J. doi: 10.1016/j.asoc.2014.07.005 – volume: 111 start-page: 177 year: 2019 ident: 10.1016/j.swevo.2021.100992_bib0046 article-title: Metaheuristic algorithms for the hybrid flow shop scheduling problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2019.06.009 – volume: 77 start-page: 111 issue: 1 year: 2017 ident: 10.1016/j.swevo.2021.100992_bib0012 article-title: Iterated greedy algorithms for the blocking flow shop scheduling problem with makespan criterion publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2016.07.002 – volume: 152 year: 2020 ident: 10.1016/j.swevo.2021.100992_bib0041 article-title: An improved iterated greedy algorithm for the distributed assembly permutation flow shop scheduling problem publication-title: Comput. Ind. Eng. – volume: 37 start-page: 925 issue: 6 year: 1989 ident: 10.1016/j.swevo.2021.100992_bib0023 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: 57 start-page: 316 issue: 3 year: 2006 ident: 10.1016/j.swevo.2021.100992_bib0026 article-title: Lagrangian relaxation algorithms for real-time hybrid flow shop scheduling with finite intermediate buffers publication-title: J. Oper. Res. Soc. doi: 10.1057/palgrave.jors.2602033 – volume: 49 start-page: 1097 issue: 3 year: 2019 ident: 10.1016/j.swevo.2021.100992_bib0036 article-title: A two-phase meta-heuristic for multiobjective flexible job shop scheduling problem with total energy consumption threshold publication-title: IEEE Trans. Cybern. doi: 10.1109/TCYB.2018.2796119 – volume: 76 start-page: 96 issue: 11 year: 2018 ident: 10.1016/j.swevo.2021.100992_bib0007 article-title: Discrete differential evolution algorithm for distributed blocking flow shop scheduling with makespan criterion publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2018.09.005 – volume: 38 start-page: 119 issue: 1 year: 2014 ident: 10.1016/j.swevo.2021.100992_bib0025 article-title: A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2013.06.005 – volume: 39 start-page: 293 issue: 3 year: 2011 ident: 10.1016/j.swevo.2021.100992_bib0018 article-title: An iterated greedy algorithm for the flow shop scheduling problem with blocking publication-title: Omega doi: 10.1016/j.omega.2010.07.007 – volume: 177 start-page: 2033 issue: 3 year: 2007 ident: 10.1016/j.swevo.2021.100992_bib0017 article-title: A simple and effective iterated greedy algorithm for the permutation flow shop scheduling problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.12.009 – year: 2017 ident: 10.1016/j.swevo.2021.100992_bib0039 article-title: Iterated-greedy-based algorithms with beam search initialization for the permutation flow shop to minimise total tardiness publication-title: Expert Syst. Appl. – volume: 224 start-page: 421 issue: 7 year: 2019 ident: 10.1016/j.swevo.2021.100992_bib0008 article-title: A multi-objective iterated local search algorithm for comprehensive energy-aware hybrid flow shop scheduling publication-title: J. Clean. Prod. doi: 10.1016/j.jclepro.2019.03.155 – volume: 114 year: 2019 ident: 10.1016/j.swevo.2021.100992_bib0034 article-title: An improved particle swarm optimization algorithm to solve hybrid flow shop scheduling problems with the effect of human factors - a case study publication-title: Comput. Oper. Res. – volume: 38 start-page: 3514 issue: 4 year: 2011 ident: 10.1016/j.swevo.2021.100992_bib0004 article-title: Real-time scheduling for reentrant hybrid flow shops: a decision tree based mechanism and its application to a TFT-LCD line publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2010.08.139 – volume: 49 issue: 2 year: 2019 ident: 10.1016/j.swevo.2021.100992_bib0016 article-title: A discrete gravitational search algorithm for the blocking flow shop problem with total flow time minimization publication-title: Appl. Intell. – volume: 52 start-page: 14 year: 2017 ident: 10.1016/j.swevo.2021.100992_bib0031 article-title: An effective modified migrating birds optimization for hybrid flow shop scheduling problem with lot streaming publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2016.12.021 – volume: 33 start-page: 3344 issue: 11 year: 2006 ident: 10.1016/j.swevo.2021.100992_bib0027 article-title: A new Lagrangian relaxation algorithm for hybrid flow shop scheduling to minimize total weighted completion time publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2005.03.028 – volume: 84 year: 2019 ident: 10.1016/j.swevo.2021.100992_bib0033 article-title: Two-stage hybrid flow shop scheduling on parallel batching machines considering a job-dependent deteriorating effect and non-identical job sizes publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2019.105701 – volume: 257 issue: 3 year: 2016 ident: 10.1016/j.swevo.2021.100992_bib0002 article-title: A new vision of approximate methods for the permutation flow shop to minimize makespan: State-of-the-art and computational evaluation publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2016.09.055 – start-page: 1 year: 2018 ident: 10.1016/j.swevo.2021.100992_bib0001 article-title: A knowledge-based cooperative algorithm for energy-efficient scheduling of distributed flow-shop publication-title: IEEE Trans. Syst. Man Cybern. Syst. doi: 10.1109/TSMC.2018.2830792 – volume: 40 start-page: 1829 issue: 7 year: 2013 ident: 10.1016/j.swevo.2021.100992_bib0043 article-title: An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2013.01.018 – volume: 45 start-page: 42 year: 2014 ident: 10.1016/j.swevo.2021.100992_bib0030 article-title: A novel discrete artificial bee colony algorithm for the hybrid flow shop scheduling problem with makespan minimisation publication-title: Omega doi: 10.1016/j.omega.2013.12.004 – volume: 164 start-page: 471 year: 2019 ident: 10.1016/j.swevo.2021.100992_bib0040 article-title: Scheduling the distributed assembly flow shop problem to minimize the makespan publication-title: Procedia Comput. Sci. doi: 10.1016/j.procs.2019.12.208 – volume: 53 start-page: 91 issue: 53 year: 2016 ident: 10.1016/j.swevo.2021.100992_bib0019 article-title: An efficient iterated greedy algorithm for the makespan blocking flow shop scheduling problem publication-title: Polibits doi: 10.17562/PB-53-10 – start-page: 1 year: 2020 ident: 10.1016/j.swevo.2021.100992_bib0028 article-title: Discrete imperialist competitive algorithm for the resource-constrained hybrid flow shop problem with energy consumption publication-title: Complex Intell. Syst. – volume: 87 start-page: 39 issue: 1 year: 2004 ident: 10.1016/j.swevo.2021.100992_bib0020 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: 60 start-page: 810 issue: 6 year: 2009 ident: 10.1016/j.swevo.2021.100992_bib0042 article-title: An iterated greedy heuristic for multistage hybrid flow shop scheduling problems with multiprocessor tasks publication-title: J. Oper. Res. Soc. doi: 10.1057/palgrave.jors.2602625 – start-page: 125 year: 2020 ident: 10.1016/j.swevo.2021.100992_bib0045 article-title: Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flow shop scheduling problem with sequence dependent setup times: A case study at a manufacturing plant publication-title: Comput. Oper. Res. – volume: 122 start-page: 235 issue: 8 year: 2018 ident: 10.1016/j.swevo.2021.100992_bib0003 article-title: An improved artificial bee colony algorithm for real-world hybrid flow shop rescheduling in steelmaking-refining continuous casting process publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2018.05.056 – volume: 40 start-page: 1874 issue: 7 year: 2013 ident: 10.1016/j.swevo.2021.100992_bib0021 article-title: Optimizing blocking flow shop scheduling problem with total completion time criterion publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2013.02.003 |
| SSID | ssj0000602559 |
| Score | 2.5648024 |
| Snippet | •A mathematical model of a blocking hybrid flow shop scheduling problem with energy consumption criteria is proposed.•A simple global perturbation based on a... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 100992 |
| SubjectTerms | Blocking Energy efficiency Hybrid flow shop scheduling problem Iterated greedy algorithm Local perturbation |
| Title | An improved iterated greedy algorithm for the energy-efficient blocking hybrid flow shop scheduling problem |
| URI | https://dx.doi.org/10.1016/j.swevo.2021.100992 |
| Volume | 69 |
| WOSCitedRecordID | wos000782991200006&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 issn: 2210-6502 databaseCode: AIEXJ dateStart: 20110301 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000602559 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELfQxgMvfCPGl_zAWzHKt5PHgoYGmibQhtQ9RbZjr91KUqVdO_577mwn7VY0ARIPjSKrdhvfT5e78939CHkrsiwVaVawOM9ilmBdjpQ8YCLhItEykbHrM3vIj47y0aj46o8L5pZOgNd1fnVVzP6rqGEMhI2ls38h7n5RGIB7EDpcQexw_SPBD2ssfWybpcZTAeyZDDfgVYM6HYjpWdNOFuMffXahtrV_TNtOEpgXIOHthuHzwfgnFnMNzLRZDebjZjYAPxjeS7583dLQbFq2xyvROroNvfTPhwl5yrJGXDvu_-baFhyIho0AnGdrJWjHTy_Z6RqyfUD7w0Q0PTq0GzvUEwafzcgFOL196pYLp22V1KDWi8AHZWA2XlPRjs1lS9u7wMP5-_kKngx8_SjEpI_CkevdaKN9jAvjulFo7UbwmHcjnhagCXeHn_dHX_rIXJBZPwtZCbv_0rWrsomBW7_2e5Nmw0w5eUjue_-CDh0uHpE7un5MHnTcHdSr8ifkYljTDia0gwl1MKE9TCjAhAJM6E2Y0A4m1MGEIkwowoSuYUI9TJ6S75_2Tz4eME-8wRRYNAsWVyY1YZSpQBaJLIThMgq0SrnkUahUpcFONNwSUgpdxegnKBFWoUllzLWR8TOyUze1fk4oz41JQEsEIo2T3IB7XGmepCJWAVJxRHsk6vauVL4rPZKjTMsu_fC8tBte4oaXbsP3yLt-0sw1Zbn961knlNLblc5eLAFIt0188a8TX5J7a8C_IjuL9lK_JnfVcjGZt2884H4BQquh9g |
| 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=An+improved+iterated+greedy+algorithm+for+the+energy-efficient+blocking+hybrid+flow+shop+scheduling+problem&rft.jtitle=Swarm+and+evolutionary+computation&rft.au=Qin%2C+Hao-Xiang&rft.au=Han%2C+Yu-Yan&rft.au=Zhang%2C+Biao&rft.au=Meng%2C+Lei-Lei&rft.date=2022-03-01&rft.pub=Elsevier+B.V&rft.issn=2210-6502&rft.volume=69&rft_id=info:doi/10.1016%2Fj.swevo.2021.100992&rft.externalDocID=S2210650221001541 |
| 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 |