Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop

This paper presents a cloud theory-based iterated greedy (CTIG) algorithm for solving the no-wait flowshop scheduling problem (NWFSP) with the objective of minimizing the sum of makespan and total weighted tardiness. The performance of the proposed CTIG algorithm is evaluated by comparing its comput...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE access Jg. 6; S. 78666 - 78677
Hauptverfasser: Lin, Shih-Wei, Lu, Chung-Cheng, Ying, Kuo-Ching
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
cloud theory-based iterated greedy algorithm
Computing time
Flowcharts
Greedy algorithms
Heuristic methods
Indexes
Industries
Job shop scheduling
Job shops
metaheuristics
no-wait flowshop
Particle swarm optimization
Scheduling
Single machine scheduling
Urban areas
ISSN:2169-3536, 2169-3536
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract This paper presents a cloud theory-based iterated greedy (CTIG) algorithm for solving the no-wait flowshop scheduling problem (NWFSP) with the objective of minimizing the sum of makespan and total weighted tardiness. The performance of the proposed CTIG algorithm is evaluated by comparing its computational results to those of the best-to-date meta-heuristic algorithm, particle swarm optimization (PSO), as presented in this paper. The experimental results concerning two sets of benchmark problem instances in this paper demonstrate that the CTIG algorithm obtains more (near) optimal solution in less computational time than the PSO algorithm. The computational results in this paper fill the research gap in the development of a novel algorithm to improve the solution quality in the case of the NWFSP with the objective of minimizing the sum of makespan and total weighted tardiness.
AbstractList This paper presents a cloud theory-based iterated greedy (CTIG) algorithm for solving the no-wait flowshop scheduling problem (NWFSP) with the objective of minimizing the sum of makespan and total weighted tardiness. The performance of the proposed CTIG algorithm is evaluated by comparing its computational results to those of the best-to-date meta-heuristic algorithm, particle swarm optimization (PSO), as presented in this paper. The experimental results concerning two sets of benchmark problem instances in this paper demonstrate that the CTIG algorithm obtains more (near) optimal solution in less computational time than the PSO algorithm. The computational results in this paper fill the research gap in the development of a novel algorithm to improve the solution quality in the case of the NWFSP with the objective of minimizing the sum of makespan and total weighted tardiness.
Author Lu, Chung-Cheng
Lin, Shih-Wei
Ying, Kuo-Ching
Author_xml – sequence: 1
  givenname: Shih-Wei
  orcidid: 0000-0003-1343-0838
  surname: Lin
  fullname: Lin, Shih-Wei
  organization: Department of Information Management, Chang Gung University, Taoyuan City, Taiwan
– sequence: 2
  givenname: Chung-Cheng
  surname: Lu
  fullname: Lu, Chung-Cheng
  organization: Department of Transportation and Logistics Management, National Chiao Tung University, Hsinchu, Taiwan
– sequence: 3
  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, Taipei, Taiwan
BookMark eNqFUU1PGzEQtRCVoJRfwMVSz5v6a3ftI4qgRQKqKlQcLcc7Tpxu7NR2hNpfj8MihHrpHDzjmXnvjfQ-ouMQAyB0QcmMUqK-XM7nV4vFjBEqZ0zKlvL-CJ0y2qmGt7w7flefoPOcN6SGrK22P0U_7nzwW__XhxUua8CL_RZHh-_ML8g7E7AJA36IxYz4EfxqXaB-TRp8gJyxr3N8H5tH4wu-HuNTXsfdJ_TBmTHD-Ws-Qz-vrx7m35rb719v5pe3jRVEloZDx2jrhOuBOwtWcDf01giuhDIU-CCJk4oZOTBBhV26-solc33vOPC-42foZuIdotnoXfJbk_7oaLx-acS00iYVb0fQhHRiEMB645ZCGCUV4VaplpBai4FWrs8T1y7F33vIRW_iPoV6vmaibRWTnTwo8mnLpphzAvemSok-WKEnK_TBCv1qRUWpf1DWF1N8DCUZP_4HezFhPQC8qcm2o3WDPwNSvJcI
CODEN IAECCG
CitedBy_id crossref_primary_10_1038_s41598_023_47729_x
crossref_primary_10_1016_j_cie_2019_07_054
crossref_primary_10_1016_j_jmsy_2023_12_006
crossref_primary_10_1109_TASE_2021_3062994
crossref_primary_10_1007_s12046_020_01432_z
crossref_primary_10_1080_0305215X_2022_2144274
crossref_primary_10_1080_00207543_2021_1886368
crossref_primary_10_1109_ACCESS_2020_3015737
crossref_primary_10_1016_j_cie_2020_106929
crossref_primary_10_1109_ACCESS_2020_2997379
Cites_doi 10.1109/ICAdLT.2013.6568480
10.1016/j.cor.2006.12.030
10.1007/BF01919082
10.1016/S0305-0548(02)00068-0
10.1016/j.knosys.2016.06.011
10.1007/s00170-010-3009-4
10.1007/s00170-005-0277-5
10.1057/jors.1992.162
10.1080/00207729708929360
10.1016/j.ijpe.2010.06.006
10.1016/S0167-6377(03)00005-1
10.1007/s00170-013-4924-y
10.1016/j.cie.2017.06.025
10.1016/j.mcm.2011.05.029
10.1016/0377-2217(93)90182-M
10.1080/00207543.2015.1047981
10.11591/ijece.v7i1.pp417-423
10.1016/j.ejor.2016.05.036
10.1080/00207543.2011.648277
10.1287/opre.20.3.689
10.1016/j.omega.2015.12.002
10.1016/j.cor.2004.02.009
10.1109/ACCESS.2018.2834954
10.1016/j.cor.2016.12.013
10.1016/j.ejor.2005.12.009
10.1016/j.eswa.2008.08.033
10.1080/00207543.2011.588617
10.1007/s00170-007-1104-y
10.1016/j.cie.2009.02.006
10.1109/ACCESS.2017.2732738
10.1016/0305-0483(83)90088-9
10.4028/www.scientific.net/AMR.189-193.2746
10.1080/00207543.2010.543937
10.1016/S0167-5060(08)70356-X
10.1016/j.ins.2018.04.038
10.1016/j.asoc.2018.08.002
10.1016/j.advengsoft.2010.06.004
10.1504/IJAOM.2010.038335
10.1057/palgrave.jors.2602625
10.1080/00207543.2015.1007245
10.1016/j.omega.2004.01.004
10.1007/s00170-007-1120-y
10.1287/opre.8.2.219
10.1080/00207543.2013.790571
10.1007/s00170-007-1099-4
10.1016/j.eswa.2009.09.006
10.1287/opre.44.3.510
10.1080/00207543.2014.910627
10.1016/j.asoc.2015.02.006
10.1016/j.eswa.2017.09.028
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018
DBID 97E
ESBDL
RIA
RIE
AAYXX
CITATION
7SC
7SP
7SR
8BQ
8FD
JG9
JQ2
L7M
L~C
L~D
DOA
DOI 10.1109/ACCESS.2018.2885137
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005-present
IEEE Open Access Journals
IEEE All-Society Periodicals Package (ASPP) 1998-Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Engineered Materials Abstracts
METADEX
Technology Research Database
Materials Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Materials Research Database
Engineered Materials Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
METADEX
Computer and Information Systems Abstracts Professional
DatabaseTitleList

Materials Research Database
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Open Access Full Text
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2169-3536
EndPage 78677
ExternalDocumentID oai_doaj_org_article_0064d4e27afb44a98903c99500a984d1
10_1109_ACCESS_2018_2885137
8561288
Genre orig-research
GrantInformation_xml – fundername: Chang Gung Memorial Hospital, Linkou
  grantid: CARPD3B0012
  funderid: 10.13039/501100005795
– fundername: Ministry of Science and Technology, Taiwan
  grantid: MOST105-2410-H-182-009-MY2/MOST107-2410-H-182-005-MY2
  funderid: 10.13039/501100004663
GroupedDBID 0R~
4.4
5VS
6IK
97E
AAJGR
ABAZT
ABVLG
ACGFS
ADBBV
AGSQL
ALMA_UNASSIGNED_HOLDINGS
BCNDV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
ESBDL
GROUPED_DOAJ
IPLJI
JAVBF
KQ8
M43
M~E
O9-
OCL
OK1
RIA
RIE
RNS
AAYXX
CITATION
7SC
7SP
7SR
8BQ
8FD
JG9
JQ2
L7M
L~C
L~D
RIG
ID FETCH-LOGICAL-c408t-3e6215f4f7e3fcec43fd7ca43949a1e3d80f892a8d2414cbf4148b2f77f3e3763
IEDL.DBID RIE
ISICitedReferencesCount 12
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000454788800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2169-3536
IngestDate Fri Oct 03 12:47:42 EDT 2025
Mon Jun 30 03:33:06 EDT 2025
Sat Nov 29 03:33:33 EST 2025
Tue Nov 18 21:08:02 EST 2025
Wed Aug 27 03:02:08 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/OAPA.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c408t-3e6215f4f7e3fcec43fd7ca43949a1e3d80f892a8d2414cbf4148b2f77f3e3763
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-1343-0838
0000-0002-9549-5290
OpenAccessLink https://ieeexplore.ieee.org/document/8561288
PQID 2455928686
PQPubID 4845423
PageCount 12
ParticipantIDs proquest_journals_2455928686
doaj_primary_oai_doaj_org_article_0064d4e27afb44a98903c99500a984d1
crossref_citationtrail_10_1109_ACCESS_2018_2885137
crossref_primary_10_1109_ACCESS_2018_2885137
ieee_primary_8561288
PublicationCentury 2000
PublicationDate 20180000
2018-00-00
20180101
2018-01-01
PublicationDateYYYYMMDD 2018-01-01
PublicationDate_xml – year: 2018
  text: 20180000
PublicationDecade 2010
PublicationPlace Piscataway
PublicationPlace_xml – name: Piscataway
PublicationTitle IEEE access
PublicationTitleAbbrev Access
PublicationYear 2018
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref14
ref53
ref52
lin (ref4) 2016; 64
ref11
ref10
ref17
ref16
ref19
ref18
piehler (ref6) 1960; 4
ref50
ding (ref30) 2015; 30
pan (ref15) 2008; 38
ref46
ref45
ref48
ref47
pan (ref24) 2008; 38
li (ref51) 1995; 32
ref42
ref41
ref44
ref43
ref49
ref8
ref7
graham (ref9) 1979; 5
ref3
ref5
montgomery (ref54) 2005
ref40
ref35
ref34
ref37
ref36
ref31
ref33
ref32
ref2
ref1
ref39
ref38
gonazelez (ref21) 1995
ref23
ref26
ref25
ref20
ref22
ref28
ref27
ref29
References_xml – ident: ref29
  doi: 10.1109/ICAdLT.2013.6568480
– ident: ref14
  doi: 10.1016/j.cor.2006.12.030
– ident: ref11
  doi: 10.1007/BF01919082
– ident: ref12
  doi: 10.1016/S0305-0548(02)00068-0
– ident: ref18
  doi: 10.1016/j.knosys.2016.06.011
– ident: ref27
  doi: 10.1007/s00170-010-3009-4
– volume: 4
  start-page: 138
  year: 1960
  ident: ref6
  article-title: Ein beitrag zum reihenfolgeproblem [A contribution to the sequencing problem]
  publication-title: Unternehmensforschung
– ident: ref23
  doi: 10.1007/s00170-005-0277-5
– ident: ref37
  doi: 10.1057/jors.1992.162
– ident: ref38
  doi: 10.1080/00207729708929360
– ident: ref26
  doi: 10.1016/j.ijpe.2010.06.006
– ident: ref22
  doi: 10.1016/S0167-6377(03)00005-1
– ident: ref3
  doi: 10.1007/s00170-013-4924-y
– ident: ref49
  doi: 10.1016/j.cie.2017.06.025
– ident: ref16
  doi: 10.1016/j.mcm.2011.05.029
– ident: ref53
  doi: 10.1016/0377-2217(93)90182-M
– ident: ref47
  doi: 10.1080/00207543.2015.1047981
– ident: ref31
  doi: 10.11591/ijece.v7i1.pp417-423
– ident: ref8
  doi: 10.1016/j.ejor.2016.05.036
– ident: ref28
  doi: 10.1080/00207543.2011.648277
– ident: ref10
  doi: 10.1287/opre.20.3.689
– volume: 64
  start-page: 115
  year: 2016
  ident: ref4
  article-title: Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics
  publication-title: Omega
  doi: 10.1016/j.omega.2015.12.002
– ident: ref13
  doi: 10.1016/j.cor.2004.02.009
– ident: ref5
  doi: 10.1109/ACCESS.2018.2834954
– ident: ref35
  doi: 10.1016/j.cor.2016.12.013
– ident: ref39
  doi: 10.1016/j.ejor.2005.12.009
– ident: ref42
  doi: 10.1016/j.eswa.2008.08.033
– volume: 32
  start-page: 16
  year: 1995
  ident: ref51
  article-title: Membership clouds and membership cloud generators
  publication-title: J Comput Res Develop
– ident: ref46
  doi: 10.1080/00207543.2011.588617
– ident: ref41
  doi: 10.1007/s00170-007-1104-y
– ident: ref25
  doi: 10.1016/j.cie.2009.02.006
– ident: ref50
  doi: 10.1109/ACCESS.2017.2732738
– ident: ref52
  doi: 10.1016/0305-0483(83)90088-9
– ident: ref34
  doi: 10.4028/www.scientific.net/AMR.189-193.2746
– ident: ref1
  doi: 10.1080/00207543.2010.543937
– volume: 5
  start-page: 287
  year: 1979
  ident: ref9
  article-title: Optimization and approximation in deterministic sequencing and scheduling: A survey
  publication-title: Ann Discrete Math
  doi: 10.1016/S0167-5060(08)70356-X
– ident: ref20
  doi: 10.1016/j.ins.2018.04.038
– start-page: 59
  year: 1995
  ident: ref21
  article-title: a hybrid genetic algorithm approach for the "no-wait" flowshop scheduling problem
  publication-title: Proceedings of 1st International Conference on Genetic Algorithms in Engineering Systems Innovations and Applications
– ident: ref17
  doi: 10.1016/j.asoc.2018.08.002
– ident: ref40
  doi: 10.1016/j.advengsoft.2010.06.004
– ident: ref33
  doi: 10.1504/IJAOM.2010.038335
– ident: ref43
  doi: 10.1057/palgrave.jors.2602625
– ident: ref32
  doi: 10.1080/00207543.2015.1007245
– ident: ref2
  doi: 10.1016/j.omega.2004.01.004
– year: 2005
  ident: ref54
  publication-title: Design and Analysis of Experiments
– volume: 38
  start-page: 778
  year: 2008
  ident: ref15
  article-title: An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion
  publication-title: Int J Adv Manuf Technol
  doi: 10.1007/s00170-007-1120-y
– ident: ref36
  doi: 10.1287/opre.8.2.219
– ident: ref48
  doi: 10.1080/00207543.2013.790571
– volume: 38
  start-page: 337
  year: 2008
  ident: ref24
  article-title: A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion
  publication-title: Int J Adv Manuf Technol
  doi: 10.1007/s00170-007-1099-4
– ident: ref45
  doi: 10.1016/j.eswa.2009.09.006
– ident: ref7
  doi: 10.1287/opre.44.3.510
– ident: ref44
  doi: 10.1080/00207543.2014.910627
– volume: 30
  start-page: 604
  year: 2015
  ident: ref30
  article-title: An improved iterated greedy algorithm with a tabu-based reconstruction strategy for the no-wait flowshop scheduling problem
  publication-title: Appl Soft Comput
  doi: 10.1016/j.asoc.2015.02.006
– ident: ref19
  doi: 10.1016/j.eswa.2017.09.028
SSID ssj0000816957
Score 2.1765008
Snippet This paper presents a cloud theory-based iterated greedy (CTIG) algorithm for solving the no-wait flowshop scheduling problem (NWFSP) with the objective of...
SourceID doaj
proquest
crossref
ieee
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 78666
SubjectTerms Algorithms
cloud theory-based iterated greedy algorithm
Computing time
Flowcharts
Greedy algorithms
Heuristic methods
Indexes
Industries
Job shop scheduling
Job shops
metaheuristics
no-wait flowshop
Particle swarm optimization
Scheduling
Single machine scheduling
Urban areas
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT9wwELYqxAEOVSlFXaCVDz2S4thOPD7SFateWBVBBTfL8UONCgliFyrx6xk7YbUSUnvpJYoTx4nH43lYzvcR8iX5nIrbUHjb1IVsmCpsxUKBtVWluEeT2GSyCTWfw_W1_rFG9ZX2hA3wwIPgjpPP9DJwZWMjpdWgmXBaV4zhufQ58cGoZy2ZyjYYylpXaoQZKpk-PplOsUdpLxd85YBxRmI-X3NFGbF_pFh5ZZezs5m9I2_HKJGeDF-3Q96E7j3ZXsMO3CXnZ23X3rZPWKAYxNGLh1vaR3pmfwc0Eh21naeXPYbW9CqvfgYsJm1Ipo22eJ_O--LKtks6u-n_LH71dx_Iz9np5fR7MfIjFE4yWBYi1Oiwo4wqiOiCkyJ65Wz611XbMggPLILmFjy6aemaiEdoeFQqipAMyx7Z6PoufCQ0gnXWNpp7lLKLUQcQZRS-LuuAk1pMCH8RlXEjeHjisLgxOYlg2gzyNUm-ZpTvhBytHrobsDP-Xv1bGoNV1QR8nS-gOphRHcy_1GFCdtMIrhqBxP4JMCGHLyNqxkm6MFxiOsWhhnr_f7z6gGyl7gzrM4dkY3n_ED6RTfe4bBf3n7N-PgOXp-Sq
  priority: 102
  providerName: Directory of Open Access Journals
Title Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop
URI https://ieeexplore.ieee.org/document/8561288
https://www.proquest.com/docview/2455928686
https://doaj.org/article/0064d4e27afb44a98903c99500a984d1
Volume 6
WOSCitedRecordID wos000454788800001&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: PRVAON
  databaseName: DOAJ Open Access Full Text
  customDbUrl:
  eissn: 2169-3536
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000816957
  issn: 2169-3536
  databaseCode: DOA
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2169-3536
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000816957
  issn: 2169-3536
  databaseCode: M~E
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Nb9QwELXaigMc-CqIhVL5wLFpE9uJ7WNZdcVlVyCK2pvl2GMR0SZVdxckDvx2xo4bVQIhcbHsxI6cPHtmPLHnEfIu6pyaWSi8bZtCtKUsbF1CgbVlLZlHkdgmsgm5WqnLS_1xhxxNZ2EAIG0-g-OYTf_y_eC20VV2oiKVo1K7ZFdKOZ7VmvwpkUBC1zIHFqpKfXI6n-M7xN1b6hhb1VXkOr-nfFKM_kyq8ockTupl8eT_OvaUPM5mJD0dcX9GdqB_Th7dCy64Tz4tu7677n5igaKVRz9vr-kQ6NJ-A5QiPbW9p-cD2t70IrlHAYtxuETZRzu8T1dDcWG7DV1cDT_WX4ebF-TL4ux8_qHIBAqFE6XaFBwa1OhBBAk8OHCCBy-djYdhta2Ae1UGpZlVHvW4cG3AVLUsSBk4RMnzkuz1Qw-vCA3KOmtbzXxohQtBg-JV4L6pGsBZz2eE3X1Z43J08UhycWXSKqPUZoTDRDhMhmNGjqZGN2NwjX9Xfx8hm6rGyNjpAmJh8kQz0cbyApi02FFhtdIld1rXZYl54asZ2Y_4TQ_J0M3Iwd0AMHkWrw0TuN5iqlHN67-3ekMexg6OLpkDsre53cJb8sB933Tr28O0vsd0-evsMA3W3yV05QM
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Nb9QwEB2VgkQ58FVQFwr4wLFpHceJ7WNZsSqiuwKxqL1Zjj0WEW1SdXdB4tdjO2lUCYTEJbIT23Ly7JnxxJ4H8DbqnJIZzJypq4zXVGSmpJiF0qIUzAWRWCeyCbFYyPNz9WkLDsazMIiYNp_hYUymf_mus5voKjuSkcpRyjtwt-Sc5f1prdGjEikkVCmG0EI5VUfH02l4i7h_Sx6GemUe2c5vqZ8UpX-gVflDFicFM3v0f117DA8HQ5Ic98g_gS1sn8KDW-EFd-HzvGmby-ZXyJBg55Evm0vSeTI33zHIkZaY1pFlF6xvcpYcpBiyccBE6Uea8JwsuuzMNGsyu-h-rr51V8_g6-z9cnqSDRQKmeVUrrMCq6DTPfcCC2_R8sI7YU08DqtMjoWT1EvFjHRBk3Nb-3CVNfNC-AKj7HkO223X4h4QL401plbM-Zpb7xXKIveFq_IKw7wvJsBuvqy2Q3zxSHNxodM6gyrdw6EjHHqAYwIHY6WrPrzGv4u_i5CNRWNs7HQjYKGHqaajleU4MmFCR7lRUtHCKlVSGtLc5RPYjfiNjQzQTWD_ZgDoYR6vNONhxcVkJasXf6_1Bu6fLOen-vTD4uNL2Imd7R00-7C9vt7gK7hnf6yb1fXrNFh_A2ij5iQ
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=Minimizing+the+Sum+of+Makespan+and+Total+Weighted+Tardiness+in+a+No-Wait+Flowshop&rft.jtitle=IEEE+access&rft.au=Lin%2C+Shih-Wei&rft.au=Lu%2C+Chung-Cheng&rft.au=Ying%2C+Kuo-Ching&rft.date=2018&rft.issn=2169-3536&rft.eissn=2169-3536&rft.volume=6&rft.spage=78666&rft.epage=78677&rft_id=info:doi/10.1109%2FACCESS.2018.2885137&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_ACCESS_2018_2885137
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2169-3536&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2169-3536&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2169-3536&client=summon