Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times

We propose four algorithms for the no-wait flow shop scheduling problem. The objective is minimizing total completion time such that makespan is not greater than a maximum value. We address the problem with sequence-dependent setup times, an important production constraint that has never been consid...

Full description

Saved in:
Bibliographic Details
Published inThe Journal of the Operational Research Society Vol. 74; no. 1; pp. 362 - 373
Main Authors Almeida, Fernando Siqueira de, Nagano, Marcelo Seido
Format Journal Article
LanguageEnglish
Published Taylor & Francis 02.01.2023
Subjects
Flow shop
greedy
makespan
no-wait
sequence-dependent setup
total completion time
Online AccessGet full text
ISSN0160-5682
1476-9360
DOI10.1080/01605682.2022.2039569

Cover

Abstract We propose four algorithms for the no-wait flow shop scheduling problem. The objective is minimizing total completion time such that makespan is not greater than a maximum value. We address the problem with sequence-dependent setup times, an important production constraint that has never been considered for this problem before. The proposed algorithms start from an initial solution and then iterate through a process that destroys and repairs the incumbent solution in order to improve it. The methods are build combining distinct destruction and construction mechanisms, where the search intensification-diversification is explored at different levels. After an initial assessment, the best proposed algorithm (IG 4 ) is chosen to be compared with three literature methods (PAL, TOB, ISA-2) developed for similar problems. Computational experiments revealed that the overall average relative percentage deviation of PAL, TOB, ISA-2, and IG 4 are 10.97%, 4.44%, 2.07%, and 0.36%, respectively. The statistical analysis confirms that IG 4 significantly outperforms the existing methods.
AbstractList We propose four algorithms for the no-wait flow shop scheduling problem. The objective is minimizing total completion time such that makespan is not greater than a maximum value. We address the problem with sequence-dependent setup times, an important production constraint that has never been considered for this problem before. The proposed algorithms start from an initial solution and then iterate through a process that destroys and repairs the incumbent solution in order to improve it. The methods are build combining distinct destruction and construction mechanisms, where the search intensification-diversification is explored at different levels. After an initial assessment, the best proposed algorithm (IG 4 ) is chosen to be compared with three literature methods (PAL, TOB, ISA-2) developed for similar problems. Computational experiments revealed that the overall average relative percentage deviation of PAL, TOB, ISA-2, and IG 4 are 10.97%, 4.44%, 2.07%, and 0.36%, respectively. The statistical analysis confirms that IG 4 significantly outperforms the existing methods.
Author Nagano, Marcelo Seido
Almeida, Fernando Siqueira de
Author_xml – sequence: 1
  givenname: Fernando Siqueira de
  orcidid: 0000-0001-9594-0051
  surname: Almeida
  fullname: Almeida, Fernando Siqueira de
  organization: University of Sao Paulo
– sequence: 2
  givenname: Marcelo Seido
  orcidid: 0000-0002-0239-1725
  surname: Nagano
  fullname: Nagano, Marcelo Seido
  organization: University of Sao Paulo
BookMark eNqFkF9LwzAUxYMouE0_gpAv0Jn-SdPgizLUCQNf9LmkyS3LbJOapJTt09u6-eKDvtx7OZxz4P7m6NxYAwjdxGQZk4LckjgnNC-SZUKSaaSc5vwMzeKM5RFPc3KOZpMnmkyXaO79jhDCScxn6LCG3mkftPQ4WGy7oFt9gPEOosHStl0DQVuDRx2w76sdyDA5W_EBvhMGa4ONjQahA64bO2C_tZ3Hgw5b7OGzByMhUtCBUWDCKIW--y7zV-iiFo2H69NeoPenx7fVOtq8Pr-sHjaRTHMWIqkylVVSURYLkjGVAi0IyxijVSJpRStSVFXBFJWVzLhSTFKR8oLlWUo4gzxdoLtjr3TWewd1KXUQ01PBCd2UMSknjOUPxnLCWJ4wjmn6K9053Qq3_zd3f8xpU1vXisG6RpVB7BvraieM1L5M_674AurOjqc
CitedBy_id crossref_primary_10_1080_0305215X_2024_2367600
crossref_primary_10_1080_01605682_2024_2337703
crossref_primary_10_1007_s13369_023_08642_7
crossref_primary_10_1016_j_cie_2022_108255
crossref_primary_10_1080_01605682_2022_2150576
crossref_primary_10_1051_ro_2024008
crossref_primary_10_1080_0305215X_2024_2302909
crossref_primary_10_1016_j_swevo_2024_101617
crossref_primary_10_1007_s12065_024_00965_0
crossref_primary_10_1088_1742_6596_2587_1_012066
Cites_doi 10.1016/j.cor.2010.10.008
10.1016/j.ejor.2010.05.041
10.1007/s00170-013-4836-x
10.1016/j.ejor.2017.10.064
10.1057/jors.1972.52
10.1016/0305-0483(83)90088-9
10.1007/s10732-014-9279-5
10.1016/j.cie.2016.12.038
10.1007/978-3-642-02836-6_2
10.1007/s13369-012-0347-6
10.1016/S0377-2217(02)00834-2
10.1080/0305215X.2016.1261247
10.1002/1520-6750(199010)37:5<695::AID-NAV3220370508>3.0.CO;2-L
10.1016/j.ijpe.2004.12.004
10.1016/j.jmsy.2014.06.007
10.1504/IJMHEUR.2010.033122
10.1016/j.ins.2018.04.038
10.1016/j.ejor.2005.12.009
10.1057/jors.1994.65
10.1057/jors.1976.176
10.1016/j.cie.2004.06.006
10.1016/j.ejor.2014.04.031
10.1007/978-1-4614-5152-5
10.2478/v10209-011-0009-6
10.1016/j.cor.2013.01.005
10.1080/00207543.2010.546380
10.1016/j.engappai.2012.05.017
10.1007/978-3-319-07124-410
10.1007/s00170-007-1120-y
10.1016/0360-8352(96)00042-3
10.1016/S0305-0548(02)00143-0
10.1016/j.amc.2019.124688
10.1016/0925-5273(93)90042-J
10.1080/00207721.2012.723054
10.1007/978-3-540-74446-7_18
10.1016/j.ejor.2012.04.034
10.1080/00207543.2013.790571
10.1057/palgrave.jors.2602625
10.1016/j.ijpe.2010.06.006
10.1016/j.ejor.2008.09.015
10.1007/s00170-009-2154-0
10.1080/00207543.2014.948578
10.1016/j.omega.2013.10.002
10.1016/j.omega.2004.01.004
10.1016/j.ejor.2006.07.029
10.1016/j.cor.2015.08.001
10.5267/j.ijiec.2010.05.003
10.1016/j.cor.2013.01.018
10.1016/j.cor.2015.02.002
10.1016/j.cor.2011.01.010
10.1080/0305215X.2020.1797000
10.1016/j.cor.2016.07.002
10.1016/j.cor.2006.12.030
10.1016/j.orp.2016.09.002
10.1080/03155986.1999.11732365
10.1016/j.cie.2019.02.041
10.1016/j.ejor.2017.11.070
10.1016/j.ejor.2010.03.030
10.1016/S0167-5060(08)70356-X
10.1016/0377-2217(93)90182-M
10.1016/j.eswa.2008.08.033
10.7232/iems.2016.15.3.206
10.1080/00207543.2019.1630777
10.1007/s00170-007-1104-y
10.1080/00207540701418960
10.1016/j.asoc.2015.02.006
10.1016/j.omega.2010.07.007
10.1080/00207548008919673
10.1016/j.ejor.2012.12.031
10.1016/j.amc.2012.06.024
10.1287/opre.20.3.689
10.1016/S0305-0548(02)00068-0
ContentType Journal Article
Copyright 2022 Operational Research Society 2022
Copyright_xml – notice: 2022 Operational Research Society 2022
DBID AAYXX
CITATION
DOI 10.1080/01605682.2022.2039569
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Sciences (General)
Computer Science
Business
EISSN 1476-9360
EndPage 373
ExternalDocumentID 10_1080_01605682_2022_2039569
2039569
Genre Research Article
GroupedDBID -~X
.DC
0BK
0R~
29L
30N
3R3
4.4
5GY
7WY
8R4
8R5
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABJNI
ABKVW
ABLIJ
ABLJU
ABMNI
ABPAQ
ABPPZ
ABXUL
ABXYU
ABYYQ
ACGFO
ACHQT
ACIWK
ACNCT
ACREN
ACTIO
ADEPB
ADFRT
ADGTB
ADMHG
AEISY
AENEX
AEXYK
AEYOC
AFAIT
AFRVT
AFTQD
AGAYW
AGDLA
AHAJD
AHDZW
AIYEW
AJRNO
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AMTXH
AQRUH
AQTUD
ASPBG
AVWKF
AWYRJ
BLEHA
CCCUG
CS3
DGEBU
DU5
EBS
F5P
JAV
JST
KYCEM
LJTGL
M4Z
MS~
O9-
P2P
Q2X
RNANH
ROSJB
RPC
RSV
RTWRZ
SOJ
TAJZE
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TN5
TTHFI
TUROJ
U5U
WH7
XSW
ZGOLN
~02
AAYXX
CITATION
ID FETCH-LOGICAL-c367t-cd4d4bcd571a047d3e58074775b2c5b5b08bb87d5cbc49dd7c5a3987643097e63
ISSN 0160-5682
IngestDate Wed Oct 01 05:02:28 EDT 2025
Thu Apr 24 23:00:27 EDT 2025
Mon Oct 20 23:48:05 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c367t-cd4d4bcd571a047d3e58074775b2c5b5b08bb87d5cbc49dd7c5a3987643097e63
ORCID 0000-0001-9594-0051
0000-0002-0239-1725
PageCount 12
ParticipantIDs informaworld_taylorfrancis_310_1080_01605682_2022_2039569
crossref_citationtrail_10_1080_01605682_2022_2039569
crossref_primary_10_1080_01605682_2022_2039569
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2023-01-02
PublicationDateYYYYMMDD 2023-01-02
PublicationDate_xml – month: 01
  year: 2023
  text: 2023-01-02
  day: 02
PublicationDecade 2020
PublicationTitle The Journal of the Operational Research Society
PublicationYear 2023
Publisher Taylor & Francis
Publisher_xml – name: Taylor & Francis
References CIT0072
CIT0071
CIT0030
CIT0074
CIT0073
CIT0032
CIT0031
CIT0034
CIT0033
CIT0070
CIT0036
CIT0035
Pinedo M. (CIT0050) 2016
CIT0038
CIT0037
CIT0039
CIT0041
CIT0040
CIT0043
CIT0042
CIT0001
CIT0045
CIT0044
CIT0003
CIT0047
CIT0002
CIT0046
CIT0005
CIT0049
CIT0004
CIT0048
CIT0007
CIT0006
CIT0009
CIT0008
CIT0052
CIT0051
CIT0010
CIT0054
CIT0053
CIT0056
CIT0011
CIT0055
CIT0014
CIT0058
CIT0013
CIT0057
CIT0016
Baker K. R. (CIT0012) 2019
CIT0015
CIT0059
CIT0018
CIT0017
CIT0019
CIT0061
CIT0060
CIT0063
CIT0062
CIT0021
CIT0065
CIT0020
CIT0064
CIT0023
CIT0067
CIT0022
CIT0066
CIT0025
CIT0069
CIT0024
CIT0068
CIT0027
CIT0026
CIT0029
CIT0028
References_xml – ident: CIT0022
  doi: 10.1016/j.cor.2010.10.008
– ident: CIT0068
  doi: 10.1016/j.ejor.2010.05.041
– ident: CIT0005
  doi: 10.1007/s00170-013-4836-x
– ident: CIT0031
  doi: 10.1016/j.ejor.2017.10.064
– ident: CIT0054
  doi: 10.1057/jors.1972.52
– ident: CIT0044
  doi: 10.1016/0305-0483(83)90088-9
– ident: CIT0051
  doi: 10.1007/s10732-014-9279-5
– ident: CIT0010
  doi: 10.1016/j.cie.2016.12.038
– ident: CIT0059
  doi: 10.1007/978-3-642-02836-6_2
– ident: CIT0013
  doi: 10.1007/s13369-012-0347-6
– ident: CIT0027
  doi: 10.1016/S0377-2217(02)00834-2
– ident: CIT0034
  doi: 10.1080/0305215X.2016.1261247
– ident: CIT0053
  doi: 10.1002/1520-6750(199010)37:5<695::AID-NAV3220370508>3.0.CO;2-L
– ident: CIT0028
  doi: 10.1016/j.ijpe.2004.12.004
– ident: CIT0043
  doi: 10.1016/j.jmsy.2014.06.007
– ident: CIT0067
  doi: 10.1504/IJMHEUR.2010.033122
– ident: CIT0036
  doi: 10.1016/j.ins.2018.04.038
– ident: CIT0057
  doi: 10.1016/j.ejor.2005.12.009
– ident: CIT0052
  doi: 10.1057/jors.1994.65
– ident: CIT0016
  doi: 10.1057/jors.1976.176
– ident: CIT0060
  doi: 10.1016/j.cie.2004.06.006
– ident: CIT0006
  doi: 10.1016/j.ejor.2014.04.031
– ident: CIT0023
  doi: 10.1007/978-1-4614-5152-5
– ident: CIT0003
  doi: 10.2478/v10209-011-0009-6
– ident: CIT0064
  doi: 10.1016/j.cor.2013.01.005
– ident: CIT0049
  doi: 10.1080/00207543.2010.546380
– ident: CIT0041
  doi: 10.1016/j.engappai.2012.05.017
– ident: CIT0061
  doi: 10.1007/978-3-319-07124-410
– ident: CIT0048
  doi: 10.1007/s00170-007-1120-y
– ident: CIT0017
  doi: 10.1016/0360-8352(96)00042-3
– ident: CIT0004
  doi: 10.1016/S0305-0548(02)00143-0
– ident: CIT0008
  doi: 10.1016/j.amc.2019.124688
– ident: CIT0032
  doi: 10.1016/0925-5273(93)90042-J
– ident: CIT0020
  doi: 10.1080/00207721.2012.723054
– ident: CIT0066
  doi: 10.1007/978-3-540-74446-7_18
– ident: CIT0045
  doi: 10.1016/j.ejor.2012.04.034
– volume-title: Principles of sequencing and scheduling
  year: 2019
  ident: CIT0012
– ident: CIT0037
  doi: 10.1080/00207543.2013.790571
– ident: CIT0071
  doi: 10.1057/palgrave.jors.2602625
– ident: CIT0065
  doi: 10.1016/j.ijpe.2010.06.006
– ident: CIT0074
  doi: 10.1016/j.ejor.2008.09.015
– ident: CIT0030
  doi: 10.1007/s00170-009-2154-0
– ident: CIT0025
  doi: 10.1080/00207543.2014.948578
– ident: CIT0046
  doi: 10.1016/j.omega.2013.10.002
– ident: CIT0002
  doi: 10.1016/j.omega.2004.01.004
– ident: CIT0058
  doi: 10.1016/j.ejor.2006.07.029
– ident: CIT0014
  doi: 10.1016/j.cor.2015.08.001
– ident: CIT0009
  doi: 10.5267/j.ijiec.2010.05.003
– ident: CIT0056
  doi: 10.1016/j.cor.2013.01.018
– ident: CIT0026
  doi: 10.1016/j.cor.2015.02.002
– ident: CIT0039
  doi: 10.1016/j.cor.2011.01.010
– ident: CIT0040
  doi: 10.1080/0305215X.2020.1797000
– ident: CIT0063
  doi: 10.1016/j.cor.2016.07.002
– ident: CIT0047
  doi: 10.1016/j.cor.2006.12.030
– ident: CIT0038
  doi: 10.1016/j.orp.2016.09.002
– ident: CIT0015
  doi: 10.1080/03155986.1999.11732365
– ident: CIT0018
  doi: 10.1016/j.cie.2019.02.041
– ident: CIT0007
  doi: 10.1016/j.ejor.2017.11.070
– ident: CIT0024
  doi: 10.1016/j.ejor.2010.03.030
– ident: CIT0033
  doi: 10.1016/S0167-5060(08)70356-X
– ident: CIT0062
  doi: 10.1016/0377-2217(93)90182-M
– ident: CIT0073
  doi: 10.1016/j.eswa.2008.08.033
– ident: CIT0042
  doi: 10.7232/iems.2016.15.3.206
– ident: CIT0070
  doi: 10.1080/00207543.2019.1630777
– ident: CIT0072
  doi: 10.1007/s00170-007-1104-y
– volume-title: Scheduling. Theory, algorithms, and systems
  year: 2016
  ident: CIT0050
– ident: CIT0029
  doi: 10.1080/00207540701418960
– ident: CIT0021
  doi: 10.1016/j.asoc.2015.02.006
– ident: CIT0055
  doi: 10.1016/j.omega.2010.07.007
– ident: CIT0035
  doi: 10.1080/00207548008919673
– ident: CIT0019
  doi: 10.1016/j.ejor.2012.12.031
– ident: CIT0011
  doi: 10.1016/j.amc.2012.06.024
– ident: CIT0069
  doi: 10.1287/opre.20.3.689
– ident: CIT0001
  doi: 10.1016/S0305-0548(02)00068-0
SSID ssj0009019
Score 2.4230127
Snippet We propose four algorithms for the no-wait flow shop scheduling problem. The objective is minimizing total completion time such that makespan is not greater...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 362
SubjectTerms Flow shop
greedy
makespan
no-wait
sequence-dependent setup
total completion time
Title Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times
URI https://www.tandfonline.com/doi/abs/10.1080/01605682.2022.2039569
Volume 74
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVLSH
  databaseName: aylor and Francis Online
  customDbUrl:
  mediaType: online
  eissn: 1476-9360
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009019
  issn: 0160-5682
  databaseCode: AHDZW
  dateStart: 19970101
  isFulltext: true
  providerName: Library Specific Holdings
– providerCode: PRVAWR
  databaseName: Taylor & Francis Science and Technology Library-DRAA
  customDbUrl:
  eissn: 1476-9360
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009019
  issn: 0160-5682
  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/eLvHCXMwpV1bi9NAFB5qF8R9ULcq7nphHnxQSkqSmcnlcfFCEdQHu7j4EjKXaLVtSpuy0F_jT_XMrUnp4vUllGkmCT1f5pw5Pef7EHoWx-DnIkECKrn-mzFKgiwpRVBxJSOtmlaZjeK798n4gr69ZJe93o9O1dKm4SOxvbav5F-sCmNgV90l-xeW3V0UBuAz2BeOYGE4_pGNx2rjiZYhhKzh7Z9Pt1oLozGsH5r415hXC8gP1xuucy76zHn5XcFKYoocF3VwVU6bYTWrr4brr_XS9bv5GuvAy-Q2MNRslh01-m8t0jpxrY5kPyzVymcZfW2fLxDdQWw2V1NpYleXzK6HHzWb7HRVWtFym6Uuv5RGHly3FQk1g5NgWt3NVsTEZCvave3kQDikm9tMwoAlVotopOx6TNMkyImVHPALtpX12QOmXX2JW9itIydWI-XAR7iiSribvtkInlIfCGwU89Yp7koV3Tc30FEMfiPso6Pz8avPn1pi59CIx-we3neJaf72626xF__sseN24prJXXTbGQ6fW3SdoJ5aDNBN3w8xQHe87gd2bmCAjjsklgN04sbX-LnjMH9xD21baOKmxh6a2EATt9DEGk3YQVOf6aGJpwvsoIk1NLGBJtbQxIfQxAaa5mLr--jizevJy3HgZD4CQZK0CYSkknIhWRqVIU0lUUwzNKUp47FgnPEw4zxLJRNc0FzKVLCS5ODFKQnzVCXkAeov6oV6iDCE2zKLde91WFEmeVYmVGUyliRisDOuThH1P34hHAe-lmKZFZGnynU2K7TNCmezUzTaTVtaEpjfTci7li0aA_vKIr4gv5x79h9zH6Fb7Uv3GPWb1UY9gaC54U8dbn8CFd7ALQ
linkProvider Library Specific Holdings
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB5BkXgcKF1ALU8fOMDBSxLbcXJEiGqBdk-t1FsUPyJWbZMVcVRpf309iQ1bJODQSxI5GSvR2OOZyfj7AN5lmV_nUs0oNwp_M6Y5LfJa00ZZkyJrWjMGisfLfHHKv52Js629MFhWiTF0MwFFjLYaJzcmo2NJ3EdERRN5gfuoMjww7-SXd-Ge8GdkMWDJ8jfwbjKSe6AIRZm4i-dv3dxYn26gl26tO4e7oOMbT-Um5_PBqbne_AHmeLtPegKPg1tKPk3jaA_u2HYG92NV_Ax2I_sDCcZgBo-2oAxnsBfae_I-IFl_eAqbhR0CEjRxHem8ebpcbay_9i4_GavZLQ4Mggz3pB8UJoXwycv63HpT15JVS9qOXtUrR5qL7or0P7p1TzB5TGIROI08vs43uWE9dtY_g9PDLyefFzSQPVDNcumoNtxwpY2QaZ1waZgViNMjpVCZFkqopFCqkEZopXlpjNSiZqW35ZwlpbQ5ew47bdfafSDe6TI-8C187NpwYVRR59wWJjPMB6tSNAfAo4orHZDQkZDjokojYGrQRoXaqII2DmD-S2w9QYH8T6DcHj-VG3MwzUSYUrF_yr64hexbeLA4OT6qjr4uv7-Eh_4WG5NG2SvYcT8H-9q7UU69GefJNXHyDkY
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB5BkSo4ULqAKE8fOMDBSxLbcXJEwGp5rThQiVsUPyJWbZNV46jS_vp6Ehu2SMChlyhyMlaisccz4_H3AbzMMr_OpZpRbhRuM6Y5LfJa00ZZkyJrWjMGil9X-fKYf_ohYjVhH8oqMYZuJqCI0Vbj5N6YJlbEvUFQNJEXeIwqwwvzPn55E27luCuGpziS1W_c3WTk9kARijLxEM_furmyPF0BL91ZdhYHoOIHT9UmJ_PBqbne_oHleK0_ugd3g1NK3k6j6BBu2HYG-7EmfgYHkfuBBFMwgzs7QIYzOAztPXkVcKxf34ft0g4BB5q4jnTeOJ2tt9bfe4efjLXsFocFQX570g8KU0L45ll9Yr2ha8m6JW1HL-q1I81pd0H6n92mJ5g6JrEEnEYWX-eb3LAZO-sfwPHiw_d3SxqoHqhmuXRUG2640kbItE64NMwKROmRUqhMCyVUUihVSCO00rw0RmpRs9Jbcs6SUtqcPYS9tmvtIyDe5TI-7C185NpwYVRR59wWJjPMh6pSNEfAo4YrHXDQkY7jtEojXGrQRoXaqII2jmD-S2wzAYH8T6DcHT6VGzMwzUSXUrF_yj6-huwL2P_2flF9-bj6_ARu-ydszBhlT2HPnQ_2mfehnHo-zpJLBycM6g
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=Heuristics+to+optimize+total+completion+time+subject+to+makespan+in+no-wait+flow+shops+with+sequence-dependent+setup+times&rft.jtitle=The+Journal+of+the+Operational+Research+Society&rft.au=Almeida%2C+Fernando+Siqueira+de&rft.au=Nagano%2C+Marcelo+Seido&rft.date=2023-01-02&rft.pub=Taylor+%26+Francis&rft.issn=0160-5682&rft.eissn=1476-9360&rft.volume=74&rft.issue=1&rft.spage=362&rft.epage=373&rft_id=info:doi/10.1080%2F01605682.2022.2039569&rft.externalDocID=2039569
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0160-5682&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0160-5682&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0160-5682&client=summon