Minimising makespan in distributed mixed no-idle flowshops

The rapid growth of distributed manufacturing in industry today has recently attracted significant research attention that has focused on distributed scheduling problems. This work studied the distributed mixed no-idle flowshop scheduling problem using makespan as an optimality criterion. To the bes...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production research Vol. 57; no. 1; pp. 48 - 60
Main Authors: Cheng, Chen-Yang, Ying, Kuo-Ching, Chen, Hsia-Hsiang, Lu, Hsiao-Shan
Format: Journal Article
Language:English
Published: London Taylor & Francis 02.01.2019
Taylor & Francis LLC
Subjects:
cloud theory-based iterated greedy algorithm
distributed mixed no-idle flowshop
Greedy algorithms
Job shops
makespan
metaheuristics
Optimality criteria
Production scheduling
Scheduling
ISSN:0020-7543, 1366-588X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The rapid growth of distributed manufacturing in industry today has recently attracted significant research attention that has focused on distributed scheduling problems. This work studied the distributed mixed no-idle flowshop scheduling problem using makespan as an optimality criterion. To the best of the authors' knowledge, this is the first paper to study the multi-flowshop extension in which each flowshop has mixed no-idle constraints. A novel cloud theory-based iterated greedy (CTBIG) algorithm was proposed for solving the problem. Computational experiments conducted on a set of test instances revealed that the proposed CTBIG algorithm significantly outperformed classic iterated greedy algorithms.
AbstractList The rapid growth of distributed manufacturing in industry today has recently attracted significant research attention that has focused on distributed scheduling problems. This work studied the distributed mixed no-idle flowshop scheduling problem using makespan as an optimality criterion. To the best of the authors' knowledge, this is the first paper to study the multi-flowshop extension in which each flowshop has mixed no-idle constraints. A novel cloud theory-based iterated greedy (CTBIG) algorithm was proposed for solving the problem. Computational experiments conducted on a set of test instances revealed that the proposed CTBIG algorithm significantly outperformed classic iterated greedy algorithms.
Author Lu, Hsiao-Shan
Chen, Hsia-Hsiang
Cheng, Chen-Yang
Ying, Kuo-Ching
Author_xml – sequence: 1
  givenname: Chen-Yang
  surname: Cheng
  fullname: Cheng, Chen-Yang
  organization: Department of Industrial Engineering and Management, National Taipei University of Technology
– sequence: 2
  givenname: Kuo-Ching
  orcidid: 0000-0002-9549-5290
  surname: Ying
  fullname: Ying, Kuo-Ching
  email: kcying@ntut.edu.tw
  organization: Department of Industrial Engineering and Management, National Taipei University of Technology
– sequence: 3
  givenname: Hsia-Hsiang
  surname: Chen
  fullname: Chen, Hsia-Hsiang
  organization: Department of Industrial Engineering and Management, National Taipei University of Technology
– sequence: 4
  givenname: Hsiao-Shan
  surname: Lu
  fullname: Lu, Hsiao-Shan
  organization: Nanya Technology Corporation
BookMark eNqFkD1PwzAQhi1UJNrCT0CKxJzijzhxYAFVfElFLCCxWY5jg0tiB9tR6b8nUcvCADfcLc97d3pmYGKdVQCcIrhAkMFzCDEsaEYWGCK2QBktGMIHYIpInqeUsdcJmI5MOkJHYBbCGg5FWTYFF4_GmtYEY9-SVnyo0AmbGJvUJkRvqj6qOmnN19CtS03dqEQ3bhPeXReOwaEWTVAn-zkHL7c3z8v7dPV097C8XqWSlDSmmuCK6kplUrG6hjmmVNZU4uFNLRjSDEskMCEZxrnKSVFRmiuCNSNSy6yQZA7Odns77z57FSJfu97b4STHqMhoWbKSDdTljpLeheCV5tJEEY2z0QvTcAT5KIv_yOKjLL6XNaTpr3TnTSv89t_c1S5nrHa-FRvnm5pHsW2c115YaQInf6_4BjzugiE
CitedBy_id crossref_primary_10_1080_0305215X_2021_1872558
crossref_primary_10_1109_TASE_2021_3062994
crossref_primary_10_1016_j_cie_2022_107961
crossref_primary_10_1016_j_swevo_2020_100804
crossref_primary_10_1016_j_ejor_2023_02_001
crossref_primary_10_1016_j_cor_2019_104839
crossref_primary_10_1016_j_knosys_2021_108036
crossref_primary_10_1016_j_cor_2021_105482
crossref_primary_10_1080_00207543_2019_1598596
crossref_primary_10_1109_ACCESS_2019_2911028
crossref_primary_10_1007_s12652_022_04392_w
crossref_primary_10_1016_j_engappai_2024_108299
crossref_primary_10_1080_0305215X_2021_1886289
crossref_primary_10_1016_j_swevo_2020_100747
crossref_primary_10_1016_j_eswa_2025_129512
crossref_primary_10_1080_00207543_2023_2254858
crossref_primary_10_1109_ACCESS_2020_2996305
crossref_primary_10_1016_j_swevo_2025_102028
crossref_primary_10_1080_00207543_2024_2383781
crossref_primary_10_1016_j_eswa_2020_113837
crossref_primary_10_1016_j_knosys_2022_108328
crossref_primary_10_1016_j_asoc_2023_110190
crossref_primary_10_1016_j_cie_2021_107337
crossref_primary_10_1016_j_cor_2021_105315
crossref_primary_10_1007_s43069_024_00304_0
crossref_primary_10_1080_00207543_2020_1753897
crossref_primary_10_1016_j_eswa_2021_115453
crossref_primary_10_1016_j_eswa_2019_113147
crossref_primary_10_1007_s00500_021_05776_4
crossref_primary_10_1016_j_swevo_2021_100874
crossref_primary_10_1016_j_knosys_2020_105527
crossref_primary_10_1080_00207543_2020_1780333
crossref_primary_10_1177_30504554251347434
crossref_primary_10_1007_s10489_020_01809_x
crossref_primary_10_1080_00207543_2020_1837982
crossref_primary_10_1016_j_simpat_2021_102455
crossref_primary_10_1016_j_swevo_2019_100557
crossref_primary_10_1109_ACCESS_2020_2993881
crossref_primary_10_1007_s40314_024_02702_w
crossref_primary_10_1109_TSMC_2023_3272311
Cites_doi 10.1080/18756891.2011.9727808
10.1080/00207543.2013.790571
10.1016/j.engappai.2009.03.003
10.1007/s00170-009-2438-4
10.1504/EJIE.2008.017687
10.1080/00207543.2014.948578
10.1016/j.ejor.2004.08.043
10.1007/978-3-319-03753-0_3
10.1016/j.cie.2004.01.008
10.1002/(ISSN)1931-9193
10.1016/j.cie.2007.04.004
10.1016/S0305-0548(03)00038-8
10.1016/0377-2217(95)00037-2
10.1016/j.ejor.2005.12.009
10.1002/9780470172483
10.1016/j.cie.2005.05.002
10.1007/s11740-017-0716-9
10.1016/j.eswa.2017.01.006
10.1016/j.asoc.2015.11.034
10.1016/j.omega.2007.02.002
10.1016/0377-2217(93)90182-M
10.1177/1063293X02010001054
10.1016/j.ejor.2005.12.024
10.1016/j.ejor.2014.05.024
10.1016/j.ejor.2003.08.030
10.1007/s10845-015-1084-y
10.1016/j.cor.2013.12.012
10.1016/j.eswa.2014.06.023
10.1007/978-1-4615-6383-9
10.1016/j.cor.2011.08.016
10.1016/j.omega.2013.10.002
10.1080/00207543.2011.644819
10.1016/S0167-5060(08)70356-X
10.1080/0305215X.2013.827673
10.1016/j.rcim.2005.11.005
10.1016/j.cor.2009.06.019
10.1007/s00170-007-1104-y
10.1016/j.cie.2017.06.025
10.1016/j.cie.2012.03.015
10.1080/00207543.2012.737948
10.1016/j.advengsoft.2010.06.004
10.1016/j.eswa.2005.04.009
10.1016/j.asoc.2015.01.069
10.1080/00207543.2015.1047981
10.1109/CEC.2016.7744065
10.1016/0305-0483(83)90088-9
ContentType Journal Article
Copyright 2018 Informa UK Limited, trading as Taylor & Francis Group 2018
2018 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2018 Informa UK Limited, trading as Taylor & Francis Group 2018
– notice: 2018 Informa UK Limited, trading as Taylor & Francis Group
DBID AAYXX
CITATION
7SC
8FD
F28
FR3
JQ2
L7M
L~C
L~D
DOI 10.1080/00207543.2018.1457812
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
ANTE: Abstracts in New Technology & Engineering
Computer and Information Systems Abstracts Professional
DatabaseTitleList Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1366-588X
EndPage 60
ExternalDocumentID 10_1080_00207543_2018_1457812
1457812
Genre Article
GrantInformation_xml – fundername: Ministry of Science and Technology of the Republic of China
  grantid: MOST106-2221-E-027-085
– fundername: Ministry of Science and Technology of the Republic of China, Taiwan
  grantid: MOST106-2221-E-027-085
GroupedDBID -~X
.7F
.QJ
0BK
0R~
29J
2DF
30N
4.4
5GY
5VS
8VB
A8Z
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFO
ACGFS
ACGOD
ACIWK
ACNCT
ACTIO
ADCVX
ADGTB
ADXPE
AEGXH
AEISY
AEMOZ
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AHQJS
AIAGR
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
DU5
EBD
EBE
EBO
EBR
EBS
EBU
EJD
EMK
EPL
ESTFP
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~9
H~P
I-F
IPNFZ
J.P
K1G
KYCEM
LJTGL
M4Z
ML~
NA5
NX~
O9-
P2P
PQQKQ
QWB
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TH9
TN5
TNC
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
ZL0
~S~
AAYXX
CITATION
7SC
8FD
F28
FR3
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c395t-f32b5fbe4ce8dd06255cd5c2457fa81f82c1a2334226e637b556e32f83cfc47c3
IEDL.DBID TFW
ISICitedReferencesCount 47
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000457733000004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0020-7543
IngestDate Wed Aug 13 08:19:49 EDT 2025
Sat Nov 29 05:36:15 EST 2025
Tue Nov 18 22:15:54 EST 2025
Mon Oct 20 23:49:40 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c395t-f32b5fbe4ce8dd06255cd5c2457fa81f82c1a2334226e637b556e32f83cfc47c3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-9549-5290
PQID 2174599898
PQPubID 30924
PageCount 13
ParticipantIDs informaworld_taylorfrancis_310_1080_00207543_2018_1457812
proquest_journals_2174599898
crossref_citationtrail_10_1080_00207543_2018_1457812
crossref_primary_10_1080_00207543_2018_1457812
PublicationCentury 2000
PublicationDate 2019-01-02
PublicationDateYYYYMMDD 2019-01-02
PublicationDate_xml – month: 01
  year: 2019
  text: 2019-01-02
  day: 02
PublicationDecade 2010
PublicationPlace London
PublicationPlace_xml – name: London
PublicationTitle International journal of production research
PublicationYear 2019
Publisher Taylor & Francis
Taylor & Francis LLC
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis LLC
References CIT0030
CIT0032
CIT0031
CIT0033
CIT0036
CIT0035
CIT0038
CIT0037
CIT0039
Zhang L. (CIT0061) 2014
Komaki G. M. (CIT0027) 2015; 9
CIT0041
CIT0042
CIT0001
CIT0044
Baptiste P. (CIT0003) 1997; 1
CIT0047
CIT0002
CIT0046
CIT0049
CIT0048
CIT0007
CIT0006
CIT0009
CIT0008
CIT0052
CIT0051
CIT0010
CIT0054
CIT0053
CIT0056
CIT0055
Deyi L. (CIT0011) 2005
Naderi B. (CIT0034) 2009
Shao W. (CIT0050) 2017
Lin S. W. (CIT0028) 2012; 8
CIT0014
CIT0058
CIT0013
CIT0057
CIT0015
CIT0059
CIT0017
CIT0019
CIT0060
CIT0062
Campbell H. G. (CIT0005) 1970; 16
CIT0021
CIT0020
CIT0023
CIT0022
CIT0025
CIT0024
CIT0026
Du X. (CIT0012) 2016
CIT0029
Gao J. (CIT0018) 2011; 6
Pan Q. (CIT0043) 2006; 17
References_xml – start-page: 1
  volume-title: 2016 IEEE Symposium Series on Computational Intelligence (SSCI)
  year: 2016
  ident: CIT0012
– ident: CIT0017
  doi: 10.1080/18756891.2011.9727808
– ident: CIT0030
  doi: 10.1080/00207543.2013.790571
– ident: CIT0032
  doi: 10.1016/j.engappai.2009.03.003
– volume: 1
  start-page: 429
  year: 1997
  ident: CIT0003
  publication-title: Proceedings of the International Conference on Industrial Engineering and Production Management
– ident: CIT0062
  doi: 10.1007/s00170-009-2438-4
– ident: CIT0042
  doi: 10.1504/EJIE.2008.017687
– ident: CIT0015
  doi: 10.1080/00207543.2014.948578
– ident: CIT0039
  doi: 10.1016/j.ejor.2004.08.043
– ident: CIT0052
  doi: 10.1007/978-3-319-03753-0_3
– ident: CIT0025
  doi: 10.1016/j.cie.2004.01.008
– ident: CIT0022
  doi: 10.1002/(ISSN)1931-9193
– ident: CIT0013
  doi: 10.1016/j.cie.2007.04.004
– ident: CIT0059
  doi: 10.1016/S0305-0548(03)00038-8
– ident: CIT0038
  doi: 10.1016/0377-2217(95)00037-2
– ident: CIT0048
  doi: 10.1016/j.ejor.2005.12.009
– start-page: 8
  volume-title: The Scientific World Journal
  year: 2014
  ident: CIT0061
– ident: CIT0023
  doi: 10.1002/9780470172483
– ident: CIT0024
  doi: 10.1016/j.cie.2005.05.002
– ident: CIT0026
  doi: 10.1007/s11740-017-0716-9
– ident: CIT0046
  doi: 10.1016/j.eswa.2017.01.006
– ident: CIT0047
  doi: 10.1016/j.asoc.2015.11.034
– ident: CIT0001
  doi: 10.1002/(ISSN)1931-9193
– ident: CIT0044
  doi: 10.1016/j.omega.2007.02.002
– volume: 6
  start-page: 3094
  issue: 14
  year: 2011
  ident: CIT0018
  publication-title: Scientific Research and Essays
– ident: CIT0051
  doi: 10.1016/0377-2217(93)90182-M
– ident: CIT0021
  doi: 10.1177/1063293X02010001054
– ident: CIT0053
  doi: 10.1016/j.ejor.2005.12.024
– ident: CIT0036
  doi: 10.1016/j.ejor.2014.05.024
– ident: CIT0049
  doi: 10.1016/j.ejor.2003.08.030
– ident: CIT0009
  doi: 10.1007/s10845-015-1084-y
– ident: CIT0014
  doi: 10.1016/j.cor.2013.12.012
– volume: 9
  start-page: 2701
  issue: 8
  year: 2015
  ident: CIT0027
  publication-title: International Journal of Social, Behavioral, Educational, Economic, Business and Industrial Engineering
– ident: CIT0033
  doi: 10.1016/j.eswa.2014.06.023
– ident: CIT0055
  doi: 10.1007/978-1-4615-6383-9
– ident: CIT0010
  doi: 10.1016/j.cor.2011.08.016
– ident: CIT0041
  doi: 10.1016/j.omega.2013.10.002
– ident: CIT0019
  doi: 10.1080/00207543.2011.644819
– ident: CIT0020
  doi: 10.1016/S0167-5060(08)70356-X
– ident: CIT0057
  doi: 10.1080/0305215X.2013.827673
– volume: 17
  start-page: 1741
  issue: 16
  year: 2006
  ident: CIT0043
  publication-title: China Mechanical Engineering
– ident: CIT0007
  doi: 10.1016/j.rcim.2005.11.005
– ident: CIT0035
  doi: 10.1016/j.cor.2009.06.019
– start-page: 9
  year: 2017
  ident: CIT0050
  publication-title: Proceedings of the IEEE Congress on Evolutionary Computation
– volume-title: Artificial Intelligence with Uncertainty
  year: 2005
  ident: CIT0011
– ident: CIT0058
  doi: 10.1007/s00170-007-1104-y
– ident: CIT0060
  doi: 10.1016/j.cie.2017.06.025
– ident: CIT0002
  doi: 10.1016/j.cie.2012.03.015
– ident: CIT0008
  doi: 10.1080/00207543.2012.737948
– ident: CIT0054
  doi: 10.1016/j.advengsoft.2010.06.004
– ident: CIT0006
  doi: 10.1016/j.eswa.2005.04.009
– volume: 8
  start-page: 6599
  issue: 10
  year: 2012
  ident: CIT0028
  publication-title: International Journal of Innovative Computing Information and Control
– ident: CIT0029
  doi: 10.1016/j.asoc.2015.01.069
– ident: CIT0031
  doi: 10.1080/00207543.2015.1047981
– volume: 16
  start-page: 630
  issue: 10
  year: 1970
  ident: CIT0005
  publication-title: Management Science Series Application
– start-page: 10
  volume-title: Proceedings of the Multidisciplinary International Conference on Scheduling: Theory and Applications
  year: 2009
  ident: CIT0034
– ident: CIT0056
  doi: 10.1109/CEC.2016.7744065
– ident: CIT0037
  doi: 10.1016/0305-0483(83)90088-9
SSID ssj0000584
Score 2.448656
Snippet The rapid growth of distributed manufacturing in industry today has recently attracted significant research attention that has focused on distributed...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 48
SubjectTerms cloud theory-based iterated greedy algorithm
distributed mixed no-idle flowshop
Greedy algorithms
Job shops
makespan
metaheuristics
Optimality criteria
Production scheduling
Scheduling
Title Minimising makespan in distributed mixed no-idle flowshops
URI https://www.tandfonline.com/doi/abs/10.1080/00207543.2018.1457812
https://www.proquest.com/docview/2174599898
Volume 57
WOSCitedRecordID wos000457733000004&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: PRVAWR
  databaseName: Taylor & Francis Online Journals
  customDbUrl:
  eissn: 1366-588X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000584
  issn: 0020-7543
  databaseCode: TFW
  dateStart: 19610101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxQADb0ShoAysRk0cJzYbQlQMUDEU6GY5zllEtGnVhMfPx06c0gqhDrBE8nCWdb6Hzzl_H0LnJguA9DnHIGmMQw4SJ1pp4_GKGYOKfKj-mD7dxf0-Gw75g-smLFxbpa2hdQ0UUcVq69wyKZqOOPuC2yS6kNjGLGZc3RhdxTNsUr_lMBj0nr9jMWUOh7mLrUjzhue3WZay0xJ26Y9YXSWg3vY_LH0HbbnTp3dVm8suWoN8D20uYBLuo8v7LM_M5puBN5avYCJO7mW5l1qEXUuOBak3zj7NN5_gLB2Bp0eTj-JlMi0O0GPvZnB9ix3BAlaE0xJrEiRUJxAqYGnaNaUQVSlVgVmWlszXLFC-DAixr20hInFCaQQk0IworcJYkUPUyic5HCGPEwIB11FgAnmY-DIBTYDEUilTgqS-bKOwUaxQDn3ckmCMhD8HKa1VI6xqhFNNG13MxaY1_MYqAb64a6Ks7j10TVIiyArZTrPFwnlyIWzJRrll2Tz-w9QnaMMMeXV3E3RQq5y9wSlaV-9lVszOKpv9As6G5h0
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NS8MwFA8yBfXgtzg_e_BaWZumTbyJOCZuO03dLaTpCxa3dqz148836cfcENlBL4VSXgjvsy957_cQutRRAITDmA2CBLbHQNihkkpbvKRaoXwHihvTp27Q79PhkM33wpiySpNDqxIoovDVxrjNYXRdEmdauHWk87CpzKLa1rXWmUHDq0THWqPlg_bztzcmtEJibtmGpu7i-W2Zhfi0gF76w1sXIai9_R-b30Fb1Q-odVNqzC5agWQPbc7BEu6j616cxFr--sUai1fQTiex4sSKDMiumY8FkTWOP_UzSe04GoGlRulH9pJOsgP02L4b3HbsasaCLTEjua2wGxIVgieBRlFLZ0NERkS6eltKUEdRVzrCxdg03IKPg5AQH7CrKJZKeoHEh6iRpAkcIYthDC5Tvqt9uRc6IgSFAQdCSp2FRI5oIq_mLJcVALmZgzHizgyntGQNN6zhFWua6GpGNikROJYRsHmx8bw4-lDlnBKOl9Ce1jLmlTFn3GRthJlBm8d_WPoCrXcGvS7v3vcfTtCG_sSKoxz3FDXy6RucoTX5nsfZ9LxQ4C940upI
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NS8MwFA8yRfTgtzid2oPXyto0beNN1KI4xw5Tdwtp-oLFrR1r_fjzTfoxN0R20EuhlBfC-8xL3_s9hM5UFABuUWoCJ57pUOBmKIVUFi98pVCuBcUf06eO1-36gwHtVdWEWVVWqXNoWQJFFL5aG_c4knVFnO7gVoHOwbowy1emrpROzxleVkdnV-df_eD52xkTvwJibpuapm7i-W2ZufA0B176w1kXESjY_Ie9b6GN6vhpXJb6so2WINlB6zOghLvo4iFOYiV99WKM-Csol5MYcWJEGmJXT8eCyBjFn-qZpGYcDcGQw_Qje0nH2R56DG76V7dmNWHBFJiS3JTYDokMwRHgR1Fb5UJERETYaluS-5b0bWFxG2Pdbgsu9kJCXMC29LGQwvEE3keNJE3gABkUY7CpdG3lyZ3Q4iFIDNjjQqgcJLJ4Ezk1Y5mo4Mf1FIwhs6YopSVrmGYNq1jTROdTsnGJv7GIgM5KjeXFxYcsp5QwvIC2VYuYVaacMZ2zEarHbB7-YelTtNq7Dljnrnt_hNbUF1rc49gt1Mgnb3CMVsR7HmeTk0J9vwC6xuj5
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=Minimising+makespan+in+distributed+mixed+no-idle+flowshops&rft.jtitle=International+journal+of+production+research&rft.au=Cheng%2C+Chen-Yang&rft.au=Ying%2C+Kuo-Ching&rft.au=Chen%2C+Hsia-Hsiang&rft.au=Lu%2C+Hsiao-Shan&rft.date=2019-01-02&rft.pub=Taylor+%26+Francis+LLC&rft.issn=0020-7543&rft.eissn=1366-588X&rft.volume=57&rft.issue=1&rft.spage=48&rft_id=info:doi/10.1080%2F00207543.2018.1457812&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7543&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7543&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7543&client=summon