Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping

Two-stage hybrid flowshop scheduling in a single factory has been considered fully; however, the distributed two-stage hybrid flowshop scheduling problem (DTHFSP) is seldom studied in a multi-factory environment. In this study, a DTHFSP with sequence-dependent setup times is investigated and a shuff...

Full description

Saved in:
Bibliographic Details
Published inEngineering optimization Vol. 52; no. 9; pp. 1461 - 1474
Main Authors Lei, Deming, Wang, Tian
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 01.09.2020
Taylor & Francis Ltd
Subjects
Algorithms
distributed scheduling
Flowcharts
Job shops
Scheduling
sequence-dependent setup times
Setup times
Shuffled frog-leaping algorithm
two-stage hybrid flowshop scheduling problem
Online AccessGet full text
ISSN0305-215X
1029-0273
DOI10.1080/0305215X.2019.1674295

Cover

Abstract Two-stage hybrid flowshop scheduling in a single factory has been considered fully; however, the distributed two-stage hybrid flowshop scheduling problem (DTHFSP) is seldom studied in a multi-factory environment. In this study, a DTHFSP with sequence-dependent setup times is investigated and a shuffled frog-leaping algorithm with memeplex grouping (MGSFLA) is proposed to minimize makespan and the number of tardy jobs. After an initial population is generated by an heuristic, two phases are executed sequentially with a new population division. In the second phase, all memeplexes are categorized into three groups, the different search processes are implemented in the different groups and the best memeplex is excluded from population division. A number of experiments are conducted on many instances and computational results validate the effectiveness of the main strategies and the promising advantages of an MGSFLA.
AbstractList Two-stage hybrid flowshop scheduling in a single factory has been considered fully; however, the distributed two-stage hybrid flowshop scheduling problem (DTHFSP) is seldom studied in a multi-factory environment. In this study, a DTHFSP with sequence-dependent setup times is investigated and a shuffled frog-leaping algorithm with memeplex grouping (MGSFLA) is proposed to minimize makespan and the number of tardy jobs. After an initial population is generated by an heuristic, two phases are executed sequentially with a new population division. In the second phase, all memeplexes are categorized into three groups, the different search processes are implemented in the different groups and the best memeplex is excluded from population division. A number of experiments are conducted on many instances and computational results validate the effectiveness of the main strategies and the promising advantages of an MGSFLA.
Author Lei, Deming
Wang, Tian
Author_xml – sequence: 1
  givenname: Deming
  surname: Lei
  fullname: Lei, Deming
  email: deminglei11@163.com
  organization: School of Automation, Wuhan University of Technology
– sequence: 2
  givenname: Tian
  surname: Wang
  fullname: Wang, Tian
  organization: School of Automation, Wuhan University of Technology
BookMark eNqFkEtr3DAURkVJoZNpfkJB0LWnevkhumkJfUGgi7SQndDIV7aCbLmSXGf-fexOsumi3dwLl-98F84luhjDCAi9oeRASUPeEU5KRsu7AyNUHmhVCybLF2hHCZMFYTW_QLstU2yhV-gypXtCKCek2aHlNvjfbuxw61KO7jhnaHFeQpGy7gD3p2N0LbY-LKkPE06mh3b2GzCnbWqc-tlav1I2hq7woKc_d9-F6HI_4GWdeIABJg8PuIth3gKv0UurfYKrp71HPz9_-nH9tbj5_uXb9cebwnDe5MI2UnCmSQmyNgJMdTzaljOphW6ACEkkhVoIC0Y2La1A27ZqLeVSgDXQaL5Hb8-9Uwy_ZkhZ3Yc5jutLxQRreFVXq4o9en9OmRhSimCVcVlnF8YctfOKErWZVs-m1WZaPZle6fIveopu0PH0X-7DmXOjDXHQS4i-VVmffIg26tG4pPi_Kx4BLPebJw
CitedBy_id crossref_primary_10_1016_j_cie_2023_109325
crossref_primary_10_1109_TASE_2021_3119353
crossref_primary_10_1016_j_swevo_2024_101681
crossref_primary_10_1016_j_eswa_2022_119151
crossref_primary_10_1007_s00521_022_07714_3
crossref_primary_10_1080_0305215X_2020_1796999
crossref_primary_10_1080_0305215X_2024_2328188
crossref_primary_10_1016_j_cor_2021_105482
crossref_primary_10_3233_JIFS_210764
crossref_primary_10_1016_j_jmsy_2023_09_017
crossref_primary_10_2139_ssrn_4165791
crossref_primary_10_1007_s11831_021_09707_2
crossref_primary_10_1016_j_swevo_2022_101190
crossref_primary_10_1007_s40747_024_01484_2
crossref_primary_10_3233_JIFS_213473
crossref_primary_10_3390_sym14020204
crossref_primary_10_1016_j_eswa_2021_115339
crossref_primary_10_1016_j_cie_2023_109717
crossref_primary_10_3390_sym15040786
crossref_primary_10_1080_00207543_2020_1867921
crossref_primary_10_1016_j_eswa_2021_115453
crossref_primary_10_1016_j_cie_2020_106638
crossref_primary_10_32604_cmes_2022_019754
crossref_primary_10_3390_machines10080661
crossref_primary_10_1109_TII_2021_3128405
crossref_primary_10_1016_j_rcim_2021_102277
crossref_primary_10_1007_s10479_022_04537_2
crossref_primary_10_1080_0305215X_2024_2423181
crossref_primary_10_1007_s10462_021_10081_5
crossref_primary_10_3390_sym15040836
crossref_primary_10_1080_00207543_2024_2324452
crossref_primary_10_1016_j_rico_2022_100177
crossref_primary_10_1109_TASE_2023_3349167
crossref_primary_10_1177_16878132231154173
crossref_primary_10_3390_sym16060697
crossref_primary_10_1007_s10878_023_01102_w
crossref_primary_10_1109_ACCESS_2020_3041369
crossref_primary_10_2478_jaiscr_2024_0006
crossref_primary_10_1007_s12652_022_04392_w
crossref_primary_10_1016_j_ejor_2022_08_009
crossref_primary_10_23919_CSMS_2022_0002
crossref_primary_10_1016_j_jmsy_2024_10_018
crossref_primary_10_1016_j_asoc_2024_111508
crossref_primary_10_1016_j_eswa_2023_121570
crossref_primary_10_1080_00207543_2024_2383781
crossref_primary_10_1016_j_knosys_2023_110309
crossref_primary_10_3390_sym13091574
crossref_primary_10_1016_j_engappai_2020_103540
crossref_primary_10_1080_00207543_2020_1753897
crossref_primary_10_1016_j_asoc_2024_112230
crossref_primary_10_1080_00207543_2022_2031331
crossref_primary_10_1007_s11042_022_13790_3
crossref_primary_10_1080_00207543_2020_1780333
crossref_primary_10_1016_j_cor_2024_106563
Cites_doi 10.1016/j.ijpe.2015.07.027
10.1007/s00170-013-5375-1
10.1016/j.ejor.2009.09.024
10.1016/j.cie.2016.07.027
10.1080/0305215X.2018.1561884
10.1109/ACCESS.2017.2732738
10.1080/00207543.2017.1304661
10.1016/j.ijpe.2013.05.004
10.1016/j.swevo.2017.04.007
10.1016/j.ces.2011.03.017
10.1016/j.cor.2012.10.015
10.1080/03052150500384759
10.1007/s11740-017-0716-9
10.1016/j.cor.2004.09.034
10.1016/S0305-0483(98)00042-5
10.1080/00207543.2013.847983
10.1016/j.amc.2012.03.018
10.1109/4235.797969
10.1016/j.eswa.2015.08.025
10.1080/00207543.2014.884290
10.1016/j.cie.2016.05.005
10.1109/4235.996017
10.1016/j.cor.2013.11.017
10.1016/S0925-5273(03)00011-2
10.3390/a8010019
10.1016/j.knosys.2017.09.026
10.1080/00207543.2011.644819
10.1016/j.eswa.2017.09.032
10.1016/j.asoc.2015.11.034
10.1016/0305-0483(83)90088-9
10.1007/s00170-010-2775-3
10.1080/0305215X.2013.827673
10.1080/00207543.2015.1035815
10.1080/00207543.2013.790571
10.1016/j.ins.2012.07.020
10.1287/opre.1060.0280
10.1109/CEC.2002.1007013
10.1016/j.ejor.2013.12.003
10.1080/00207543.2016.1162341
10.1016/j.ins.2011.06.014
10.1007/s00170-008-1558-6
10.1155/S1024123X99000976
10.1080/0305215X.2019.1577407
10.1080/00207543.2017.1401241
10.1080/00207543.2015.1088970
10.1080/00207543.2016.1262082
10.1016/j.cor.2010.10.009
10.1016/j.ejor.2014.05.024
10.1016/j.asoc.2011.08.013
10.1016/j.asoc.2015.01.003
10.1016/j.cor.2012.07.015
10.1007/s00170-017-1429-0
ContentType Journal Article
Copyright 2019 Informa UK Limited, trading as Taylor & Francis Group 2019
2019 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2019 Informa UK Limited, trading as Taylor & Francis Group 2019
– notice: 2019 Informa UK Limited, trading as Taylor & Francis Group
DBID AAYXX
CITATION
7SC
7TB
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
DOI 10.1080/0305215X.2019.1674295
DatabaseName CrossRef
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Civil Engineering Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Civil Engineering Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Civil Engineering Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1029-0273
EndPage 1474
ExternalDocumentID 10_1080_0305215X_2019_1674295
1674295
Genre Research Article
GroupedDBID -~X
.7F
.QJ
0BK
0R~
29G
2DF
30N
4.4
5GY
5VS
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFS
ACGOD
ACIWK
ACTIO
ADCVX
ADGTB
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
EBS
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~P
IPNFZ
J.P
KYCEM
LJTGL
M4Z
NA5
NX~
O9-
P2P
PQQKQ
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TN5
TNC
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
~S~
AAYXX
CITATION
7SC
7TB
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
ID FETCH-LOGICAL-c338t-f89432a05e97c4ec6bbfd329a4a8e049091e744fec98d16eafd6df1394efce8a3
ISSN 0305-215X
IngestDate Wed Aug 13 02:35:24 EDT 2025
Wed Oct 01 04:49:54 EDT 2025
Thu Apr 24 23:08:03 EDT 2025
Mon Oct 20 23:49:03 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 9
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c338t-f89432a05e97c4ec6bbfd329a4a8e049091e744fec98d16eafd6df1394efce8a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2428367601
PQPubID 53195
PageCount 14
ParticipantIDs crossref_citationtrail_10_1080_0305215X_2019_1674295
informaworld_taylorfrancis_310_1080_0305215X_2019_1674295
proquest_journals_2428367601
crossref_primary_10_1080_0305215X_2019_1674295
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 9/1/2020
2020-09-01
20200901
PublicationDateYYYYMMDD 2020-09-01
PublicationDate_xml – month: 09
  year: 2020
  text: 9/1/2020
  day: 01
PublicationDecade 2020
PublicationPlace Abingdon
PublicationPlace_xml – name: Abingdon
PublicationTitle Engineering optimization
PublicationYear 2020
Publisher Taylor & Francis
Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis Ltd
References CIT0030
CIT0032
CIT0031
CIT0034
CIT0033
CIT0036
CIT0035
CIT0038
CIT0037
CIT0041
CIT0040
CIT0043
CIT0042
CIT0001
CIT0045
CIT0044
Lei D. M. (CIT0022) 2019
CIT0003
CIT0002
CIT0046
CIT0005
CIT0049
CIT0004
CIT0048
CIT0007
CIT0006
CIT0008
CIT0050
CIT0052
Deng J. (CIT0009) 2017; 54
CIT0051
CIT0010
CIT0054
CIT0012
CIT0056
CIT0011
CIT0055
CIT0014
CIT0058
CIT0013
CIT0016
CIT0015
CIT0018
CIT0017
Tan Y. (CIT0039) 2017; 21
CIT0019
CIT0021
CIT0020
CIT0023
Zhou B. H. (CIT0057) 2019
CIT0025
CIT0024
CIT0027
CIT0026
CIT0029
CIT0028
References_xml – ident: CIT0014
  doi: 10.1016/j.ijpe.2015.07.027
– ident: CIT0034
  doi: 10.1007/s00170-013-5375-1
– ident: CIT0037
  doi: 10.1016/j.ejor.2009.09.024
– ident: CIT0027
  doi: 10.1016/j.cie.2016.07.027
– ident: CIT0054
  doi: 10.1080/0305215X.2018.1561884
– ident: CIT0050
  doi: 10.1109/ACCESS.2017.2732738
– ident: CIT0052
  doi: 10.1080/00207543.2017.1304661
– ident: CIT0045
  doi: 10.1016/j.ijpe.2013.05.004
– ident: CIT0026
  doi: 10.1016/j.swevo.2017.04.007
– volume: 21
  start-page: 1
  issue: 1
  year: 2017
  ident: CIT0039
  publication-title: Journal of Scheduling
– ident: CIT0040
  doi: 10.1016/j.ces.2011.03.017
– ident: CIT0043
  doi: 10.1016/j.cor.2012.10.015
– ident: CIT0010
  doi: 10.1080/03052150500384759
– ident: CIT0017
  doi: 10.1007/s11740-017-0716-9
– ident: CIT0002
  doi: 10.1016/j.cor.2004.09.034
– ident: CIT0001
  doi: 10.1016/S0305-0483(98)00042-5
– year: 2019
  ident: CIT0022
  publication-title: International Journal of Production Research
– ident: CIT0044
  doi: 10.1080/00207543.2013.847983
– ident: CIT0024
  doi: 10.1016/j.amc.2012.03.018
– ident: CIT0058
  doi: 10.1109/4235.797969
– ident: CIT0020
  doi: 10.1016/j.eswa.2015.08.025
– ident: CIT0046
  doi: 10.1080/00207543.2014.884290
– ident: CIT0029
  doi: 10.1016/j.cie.2016.05.005
– ident: CIT0008
  doi: 10.1109/4235.996017
– year: 2019
  ident: CIT0057
  publication-title: Soft Computing
– ident: CIT0004
  doi: 10.1016/j.cor.2013.11.017
– ident: CIT0025
  doi: 10.1016/S0925-5273(03)00011-2
– ident: CIT0030
  doi: 10.3390/a8010019
– ident: CIT0038
  doi: 10.1016/j.knosys.2017.09.026
– ident: CIT0013
  doi: 10.1080/00207543.2011.644819
– ident: CIT0051
  doi: 10.1016/j.eswa.2017.09.032
– ident: CIT0036
  doi: 10.1016/j.asoc.2015.11.034
– ident: CIT0032
  doi: 10.1016/0305-0483(83)90088-9
– ident: CIT0033
  doi: 10.1007/s00170-010-2775-3
– ident: CIT0048
  doi: 10.1080/0305215X.2013.827673
– ident: CIT0018
  doi: 10.1080/00207543.2015.1035815
– ident: CIT0028
  doi: 10.1080/00207543.2013.790571
– ident: CIT0005
  doi: 10.1016/j.ins.2012.07.020
– ident: CIT0007
  doi: 10.1287/opre.1060.0280
– ident: CIT0016
  doi: 10.1109/CEC.2002.1007013
– ident: CIT0012
  doi: 10.1016/j.ejor.2013.12.003
– volume: 54
  start-page: 1
  issue: 12
  year: 2017
  ident: CIT0009
  publication-title: International Journal of Production Research
– ident: CIT0011
  doi: 10.1080/00207543.2016.1162341
– ident: CIT0041
  doi: 10.1016/j.ins.2011.06.014
– ident: CIT0035
  doi: 10.1007/s00170-008-1558-6
– ident: CIT0019
  doi: 10.1155/S1024123X99000976
– ident: CIT0055
  doi: 10.1080/0305215X.2019.1577407
– ident: CIT0056
  doi: 10.1080/00207543.2017.1401241
– ident: CIT0021
  doi: 10.1080/00207543.2015.1088970
– ident: CIT0023
  doi: 10.1080/00207543.2016.1262082
– ident: CIT0049
  doi: 10.1016/j.cor.2010.10.009
– ident: CIT0031
  doi: 10.1016/j.ejor.2014.05.024
– ident: CIT0015
  doi: 10.1016/j.asoc.2011.08.013
– ident: CIT0006
  doi: 10.1016/j.asoc.2015.01.003
– ident: CIT0042
  doi: 10.1016/j.cor.2012.07.015
– ident: CIT0003
  doi: 10.1007/s00170-017-1429-0
SSID ssj0013008
Score 2.4929547
Snippet Two-stage hybrid flowshop scheduling in a single factory has been considered fully; however, the distributed two-stage hybrid flowshop scheduling problem...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1461
SubjectTerms Algorithms
distributed scheduling
Flowcharts
Job shops
Scheduling
sequence-dependent setup times
Setup times
Shuffled frog-leaping algorithm
two-stage hybrid flowshop scheduling problem
Title Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping
URI https://www.tandfonline.com/doi/abs/10.1080/0305215X.2019.1674295
https://www.proquest.com/docview/2428367601
Volume 52
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVLSH
  databaseName: aylor and Francis Online
  customDbUrl:
  mediaType: online
  eissn: 1029-0273
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0013008
  issn: 0305-215X
  databaseCode: AHDZW
  dateStart: 19970501
  isFulltext: true
  providerName: Library Specific Holdings
– providerCode: PRVAWR
  databaseName: Taylor & Francis Science and Technology Library-DRAA
  customDbUrl:
  eissn: 1029-0273
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0013008
  issn: 0305-215X
  databaseCode: 30N
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://www.tandfonline.com/page/title-lists
  providerName: Taylor & Francis
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lj9owELYoe2kPVZ_qttvKh96ioDycLD6u-hDqoZeyKuolMskYKgWCIIh2f_3OxHYSuqtutwciFMkWMB8znsl83zD2XpAMF6RogQTAF4AJK6YRNI84j0Ssw1Dpptviazq5FF9myWww6Hct7ev5KL-6lVfyP1bFe2hXYsnew7LtpngD36N98YoWxus_2fhbVTb1gILUb2lwFZ4e60Pl44lvAd7yN7GxPF1Wh92y2niYx2Jcaejn-6ZCoLzdcq91iav0tlr4JaiGPaXKRbX9WS9Xpkq7ghVsSvjlNQwQF-pcNb_TM_QqdD8ry-vsGn0Mk500TBZd9d54mKnDpi07YI7p-qpaulWQ-HhemJlAYrwn9dKQQE7fvSZRD0ay5ytpongv7obCjOu54dNtE2RMNONkRt14ckTcichM5zzW0P4jtrUdh6GTQrXbZLRNZrd5wE4iDArBkJ1cTD7--N49hgqakYbtd3UUMBJnv-3zHB1ujqRvb4T65vwyfcIe28SDXxgUPWUDWD9jj3rme84OFk-8hyfe4okbPHGHJ97hiTd44oo7PPE-nniLJ0544g5P3OHpBbv8_Gn6YeLbwRx-Hsfj2tck2h-pIAF5ngvI0_lcF3EklVBjoEfJMoRzITTkclyEKShdpIXGXEOAzmGs4pdsuK7W8IokA0AQOTrFF8aSSEWFloVMVChzHcjolAn3i2a5Va2n4Sll9leLnrJRu2xjZFvuWiD75srqpl6mzXCbLL5j7ZmzbWa9wy6LSMkwpY6z1_f9LG_Yw-4fd8aG9XYPb_HoW8_fWYBeA8ylqiw
linkProvider Library Specific Holdings
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELZ4DMDAG_HGA2tK4zghHhEClVcXQOpmuc65RaRN1aYq8OvxOQkUEGJgjXJWYp99D3_3HSHHHGm4ILIrEAJ4HGzAasMI7EesGQ-M7yvj0BbNqPHIr1tha6oWBmGVGEObgijCndW4uTEZXUHiTlBJralqITJL1BBHz0Q4S-ZD6-xjF4Og3vy8Sai7rnQo4qFMVcXz2zBf7NMX9tIfp7UzQZcrRFcfXyBPnmvjvF3Tb994Hf_3d6tkufRQ6VmhUmtkBvrrZGmKt3CDTO6zFBMRNEHaXeyYBQnNJ5lnXc0O0O4rloFRk2aTUTcbUBtAW4OGde8UYfYdquioOzYmtVJmmHW8FNTAPU872fAp7_YopodpD3owSOGFutIT-8Imeby8eDhveGUHB0_b0Df3DLK7M1UPQZxqDjpqt00SMKG4igHvHIUPp5wb0CJO_AiUSaLEWKeUg9EQq2CLzPWzPmxjbTlwrKKNYux0HzPFEiMSESpfaFMXbIfwat2kLunNsctGKv2KBbWcV4nzKst53SG1D7FBwe_xl4CYVgqZu8SKKbqgyOAP2f1Kg2R5VIwkQ8q7CKFJu_8Y-ogsNB7ubuXtVfNmjywyzAo4JNw-mcuHYziwrlPePnR74x2LdAx5
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwELYKlRA99AFUpYXiA9csG68T4mPVdgUtWlVqkbhZjj2zWzW7iXaz2sKvr8dJykuIA9coYyX22PPwN98wdiiJhgtSvwIJQCTBB6w-jKB-xFbIAcaxwYC2GKUn5_LbRdKhCRctrJJiaGyIIsJZTZu7ctgh4o5IR72luiBgluoRjF6oZI09T-lWjKo4-qPri4R-aEpHIhHJdEU8Dw1zyzzdIi-9d1gHCzR8xfLu2xvgyZ_ess579uoOreOTfu41e9n6p_xTo1Bv2DOYbbEXN1gLt9nqZ1lQGoI7It2lflngeL0qI-9ojoFPLqkIjGNRrhaTsuI-fPbmjKreOYHsx9zwxWSJWHgpnJfjqABThefFuJz_ridTTslhPoUpVAX85aHwxL-ww86HX399Pona_g2R9YFvHSFxuwvTT0AdWwk2zXN0A6GMNBnQjaOK4VhKBKsyF6dg0KUOvUsqAS1kZvCWrc_KGbyjynKQVEObZtTnPhNGOFROJSZWFvtK7DLZLZu2Lbk59dgodNxxoLbzqmledTuvu6z3X6xq2D0eE1A3dULXIa2CTQ8UPXhEdq9TIN0eFAstiPAuJWDS-ycMfcA2fnwZ6rPT0fcPbFNQSiDA4PbYej1fwr73m-r8Y9gZ_wAwkQsd
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=Solving+distributed+two-stage+hybrid+flowshop+scheduling+using+a+shuffled+frog-leaping+algorithm+with+memeplex+grouping&rft.jtitle=Engineering+optimization&rft.au=Lei%2C+Deming&rft.au=Wang%2C+Tian&rft.date=2020-09-01&rft.issn=0305-215X&rft.eissn=1029-0273&rft.volume=52&rft.issue=9&rft.spage=1461&rft.epage=1474&rft_id=info:doi/10.1080%2F0305215X.2019.1674295&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_0305215X_2019_1674295
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-215X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-215X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-215X&client=summon