An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times
In this article, we address the m -machine no-wait flow shop scheduling problem with sequence dependent setup times. The objective is to minimize total tardiness subject to an upper bound on makespan. Although these constraints and performance measures have all been extensively studied independently...
Saved in:
| Published in | 4OR Vol. 22; no. 1; pp. 31 - 45 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.03.2024
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1619-4500 1614-2411 |
| DOI | 10.1007/s10288-023-00535-7 |
Cover
| Abstract | In this article, we address the
m
-machine no-wait flow shop scheduling problem with sequence dependent setup times. The objective is to minimize total tardiness subject to an upper bound on makespan. Although these constraints and performance measures have all been extensively studied independently, they have never been considered together in this problem before. So, this multi-criteria approach provides more realistic solutions for complex scenarios. To solve the problem, we developed a new heuristic called
I
G
A
. The proposed method repeatedly performs a process of destruction and construction of an existing solution in order to improve it. The novelty of this method includes a mechanism capable of adapting the destruction intensity according to the instance size and the number of iterations, calibrating the algorithm during the search. Computational experiments indicate that
I
G
A
outperforms the best literature method for similar applications in overall solution quality by about 35%. Therefore,
I
G
A
is recommended to solve the problem. |
|---|---|
| AbstractList | In this article, we address the
m
-machine no-wait flow shop scheduling problem with sequence dependent setup times. The objective is to minimize total tardiness subject to an upper bound on makespan. Although these constraints and performance measures have all been extensively studied independently, they have never been considered together in this problem before. So, this multi-criteria approach provides more realistic solutions for complex scenarios. To solve the problem, we developed a new heuristic called
I
G
A
. The proposed method repeatedly performs a process of destruction and construction of an existing solution in order to improve it. The novelty of this method includes a mechanism capable of adapting the destruction intensity according to the instance size and the number of iterations, calibrating the algorithm during the search. Computational experiments indicate that
I
G
A
outperforms the best literature method for similar applications in overall solution quality by about 35%. Therefore,
I
G
A
is recommended to solve the problem. In this article, we address the m-machine no-wait flow shop scheduling problem with sequence dependent setup times. The objective is to minimize total tardiness subject to an upper bound on makespan. Although these constraints and performance measures have all been extensively studied independently, they have never been considered together in this problem before. So, this multi-criteria approach provides more realistic solutions for complex scenarios. To solve the problem, we developed a new heuristic called IGA. The proposed method repeatedly performs a process of destruction and construction of an existing solution in order to improve it. The novelty of this method includes a mechanism capable of adapting the destruction intensity according to the instance size and the number of iterations, calibrating the algorithm during the search. Computational experiments indicate that IGA outperforms the best literature method for similar applications in overall solution quality by about 35%. Therefore, IGA is recommended to solve the problem. |
| Author | Nagano, Marcelo Seido de Almeida, Fernando Siqueira |
| Author_xml | – sequence: 1 givenname: Fernando Siqueira surname: de Almeida fullname: de Almeida, Fernando Siqueira organization: Department of Production Engineering, University of Sao Paulo – sequence: 2 givenname: Marcelo Seido orcidid: 0000-0002-0239-1725 surname: Nagano fullname: Nagano, Marcelo Seido email: drnagano@usp.br organization: Department of Production Engineering, University of Sao Paulo |
| BookMark | eNp9kE1r3DAQhkVJoUnaP9CTIGc1ow9b1jGEfkGgl_YsJHu00WJLjqTtkv76OtlCoIecZg7vM_PyXJCzlBMS8pHDJw6grysHMQwMhGQAneyYfkPOec8VE4rzs-fdMNUBvCMXte4BpJQKzsmfm0QxhDhGTI3GhsU1nOiuIE6P1M27XGK7X2jIhTq6HOYWWfZ7HFv8jTRldnSx0TDnI633eaVryX7GhR43ilZ8OGAakU64YpqePlRsh5W2uGB9T94GN1f88G9ekl9fPv-8_cbufnz9fntzx0YFpjGvRKcnPxkFSg1dzyfRT4N3YFByrY033vfOSeWEE8EPAkLvjcFeK6MxgLwkV6e7W7etT212nw8lbS-tBAmm11zJLTWcUmPJtRYMdozNtZhTKy7OloN9Mm1Ppu1m2j6btnpDxX_oWuLiyuPrkDxBdQunHZaXVq9QfwFVNZRx |
| CitedBy_id | crossref_primary_10_1016_j_cor_2025_106989 crossref_primary_10_1007_s13369_023_08642_7 crossref_primary_10_1051_ro_2024008 crossref_primary_10_1007_s12065_024_00965_0 |
| Cites_doi | 10.4236/ica.2015.61005 10.1016/S0305-0548(02)00143-0 10.1016/j.ejor.2005.12.009 10.1007/s40430-013-0064-4 10.1287/ijoc.1070.0258 10.2478/v10209-011-0009-6 10.1016/0305-0483(83)90088-9 10.1016/j.orp.2016.09.002 10.1016/j.ejor.2017.11.070 10.1007/978-1-4614-5152-5 10.1016/j.ins.2018.04.038 10.1016/j.cor.2011.01.010 10.1016/j.ejor.2014.04.031 10.1016/j.cor.2010.10.008 10.1016/j.omega.2013.10.002 10.1016/j.cor.2015.02.002 10.1016/0377-2217(93)90182-M 10.1016/j.ejor.2017.10.064 10.1080/00207540500282914 10.1080/0951192X.2013.812802 10.1007/s00170-013-4836-x 10.1016/j.ejor.2012.12.031 10.1016/j.cor.2016.07.002 10.1016/j.ijpe.2004.12.004 10.1016/j.cie.2019.05.034 10.1016/j.ejor.2006.07.029 10.1109/CCDC.2013.6561117 10.1016/j.ifacol.2015.06.315 10.1109/CSCWD.2012.6221909 10.1109/CSCWD.2013.6580989 10.1007/11424925_50 10.1080/00207543.2014.974846 10.4028/www.scientific.net/AMR.933.459 |
| ContentType | Journal Article |
| Copyright | The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Copyright Springer Nature B.V. Mar 2024 |
| Copyright_xml | – notice: The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. – notice: Copyright Springer Nature B.V. Mar 2024 |
| DBID | AAYXX CITATION 3V. 7WY 7WZ 7XB 87Z 8AL 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L6V M0C M0N M7S P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS PYYUZ Q9U |
| DOI | 10.1007/s10288-023-00535-7 |
| DatabaseName | CrossRef ProQuest Central (Corporate) ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Computing Database (Alumni Edition) ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central Business Premium Collection ProQuest Technology Collection (LUT) ProQuest One Community College ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest ABI/INFORM Global Computing Database Engineering Database (Proquest) ProQuest Advanced Technologies & Aerospace Collection Proquest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ABI/INFORM Collection China ProQuest Central Basic |
| DatabaseTitle | CrossRef ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest One Business Computer Science Database ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ABI/INFORM Complete ProQuest Central ABI/INFORM Professional Advanced ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) ABI/INFORM Complete (Alumni Edition) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global ProQuest Computing Engineering Database ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ABI/INFORM China ProQuest Technology Collection ProQuest SciTech Collection ProQuest Business Collection ProQuest One Academic UKI Edition Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest One Academic ProQuest Central (Alumni) ProQuest One Academic (New) Business Premium Collection (Alumni) |
| DatabaseTitleList | ABI/INFORM Global (Corporate) |
| Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1614-2411 |
| EndPage | 45 |
| ExternalDocumentID | 10_1007_s10288_023_00535_7 |
| GrantInformation_xml | – fundername: Conselho Nacional de Desenvolvimento Científico e Tecnológico grantid: 312585/2021-7 funderid: http://dx.doi.org/10.13039/501100003593 – fundername: Coordenação de Aperfeiçoamento de Pessoal de Nível Superior grantid: 88882.379108/2019-01 funderid: http://dx.doi.org/10.13039/501100002322 |
| GroupedDBID | -57 -5G -BR -EM -Y2 -~C .86 .VR 06D 0R~ 0VY 1N0 203 23M 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5VS 67Z 6NX 7WY 8FE 8FG 8FL 8TC 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACREN ACSNA ACZOJ ADFRT ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFGCZ AFKRA AFLOW AFQWF AFWTZ AFYQB AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMTXH AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ ASPBG AVWKF AXYYD AYQZM AZFZN AZQEC B-. BA0 BAPOH BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DWQXO EBLON EBS EIOEI EJD EOH ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GXS H13 HCIFZ HF~ HG5 HG6 HLICF HMJXF HQYDN HRMNR HVGLF HZ~ I09 IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z J9A JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV L6V LAS LLZTM M0C M0N M4Y M7S MA- N2Q N9A NB0 NPVJJ NQJWS NU0 O9- O93 O9G O9J OAM P9M PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PTHSS Q2X QOS R89 R9I ROL RPX RSV S16 S1Z S27 S3B SAP SBE SDH SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z83 ZMTXR ~A9 AAPKM AAYXX ABBRH ABDBE ABRTQ ADHKG AFDZB AFOHR AGQPQ AHPBZ ATHPR AYFIA CITATION PHGZM PHGZT PQGLB PUEGO 7XB 8AL 8FK JQ2 L.- P62 PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c409t-b4257dbd940448561d26d8ba09e31779b9bb6aa34a2a2fb820f6b99e67497ef03 |
| IEDL.DBID | BENPR |
| ISSN | 1619-4500 |
| IngestDate | Fri Jul 25 09:27:43 EDT 2025 Thu Apr 24 23:02:43 EDT 2025 Wed Oct 01 02:15:20 EDT 2025 Fri Feb 21 02:41:17 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | No-wait 68T20 Iterated greedy Flow shop Makespan 90C59 Sequence-dependent setup Total tardiness |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c409t-b4257dbd940448561d26d8ba09e31779b9bb6aa34a2a2fb820f6b99e67497ef03 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-0239-1725 |
| PQID | 3030967143 |
| PQPubID | 326374 |
| PageCount | 15 |
| ParticipantIDs | proquest_journals_3030967143 crossref_citationtrail_10_1007_s10288_023_00535_7 crossref_primary_10_1007_s10288_023_00535_7 springer_journals_10_1007_s10288_023_00535_7 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2024-03-01 |
| PublicationDateYYYYMMDD | 2024-03-01 |
| PublicationDate_xml | – month: 03 year: 2024 text: 2024-03-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg – name: Heidelberg |
| PublicationSubtitle | A Quarterly Journal of Operations Research |
| PublicationTitle | 4OR |
| PublicationTitleAbbrev | 4OR-Q J Oper Res |
| PublicationYear | 2024 |
| Publisher | Springer Berlin Heidelberg Springer Nature B.V |
| Publisher_xml | – name: Springer Berlin Heidelberg – name: Springer Nature B.V |
| References | Allahverdi, Aydilek, Aydilek (CR7) 2020; 365 Aldowaisan, Allahverdi (CR2) 2015; 6 Pinedo (CR29) 2016 Allahverdi, Aydilek (CR5) 2014; 238 Lopez-Ibanez, Dubois-Lacoste, Caceres (CR21) 2016; 3 CR19 CR38 Franca, Tin, Buriol (CR18) 2006; 44 Aldowaisan, Allahverdi (CR1) 2012; 37 Nawaz, Enscore, Ham (CR27) 1983; 11 CR33 Ciavotta, Minella, Ruiz (CR12) 2013; 227 CR32 Framinan, Perez-Gonzalez (CR17) 2018; 266 Allahverdi (CR3) 2004; 31 Minella, Ruiz, Ciavotta (CR23) 2011; 38 Bianco, Dell’Olmo, Giordani (CR11) 1999; 37 Dubois-Lacoste, Lopez-Ibanez, Stutzle (CR13) 2011; 38 Pan, Ruiz (CR28) 2014; 44 Tkindt, Billaut (CR37) 2006 Yamada, Nagano, Miyata (CR39) 2021; 12 Baker, Trietsch (CR10) 2019 Ruiz, Stützle (CR30) 2007; 177 Tasgetiren, Kizilay, Pan (CR36) 2017; 77 Allahverdi, Aydilek, Aydilek (CR6) 2018; 269 Ruiz, Stützle (CR31) 2008; 187 Miyata, Nagano, Gupta (CR24) 2019; 135 Li, Yang, Ruiz (CR20) 2018; 453 Emmons, Vairaktarakis (CR14) 2013 Ara, Nagano (CR8) 2011; 2 Samarghandi, ElMekkawy (CR34) 2014; 27 Minella, Ruiz, Ciavotta (CR22) 2008; 20 Allahverdi, Aydilek (CR4) 2013; 68 Aydilek, Allahverdi (CR9) 2012; 219 Fernandez-Viagas, Framinan (CR15) 2015; 60 CR42 CR41 CR40 Nagano, Almeida, Miyata (CR26) 2020; 53 Taillard (CR35) 1993; 64 Framinan, Leisten (CR16) 2006; 99 Nagano, Araújo (CR25) 2014; 36 M Lopez-Ibanez (535_CR21) 2016; 3 DC Ara (535_CR8) 2011; 2 T Aldowaisan (535_CR1) 2012; 37 G Minella (535_CR23) 2011; 38 535_CR42 V Fernandez-Viagas (535_CR15) 2015; 60 M Nawaz (535_CR27) 1983; 11 535_CR41 M Pinedo (535_CR29) 2016 535_CR40 A Allahverdi (535_CR5) 2014; 238 E Taillard (535_CR35) 1993; 64 H Emmons (535_CR14) 2013 QK Pan (535_CR28) 2014; 44 JM Framinan (535_CR16) 2006; 99 G Minella (535_CR22) 2008; 20 T Aldowaisan (535_CR2) 2015; 6 PM Franca (535_CR18) 2006; 44 R Ruiz (535_CR31) 2008; 187 H Samarghandi (535_CR34) 2014; 27 A Allahverdi (535_CR6) 2018; 269 HH Miyata (535_CR24) 2019; 135 MS Nagano (535_CR26) 2020; 53 L Bianco (535_CR11) 1999; 37 A Allahverdi (535_CR7) 2020; 365 MS Nagano (535_CR25) 2014; 36 T Yamada (535_CR39) 2021; 12 JM Framinan (535_CR17) 2018; 266 A Allahverdi (535_CR4) 2013; 68 J Dubois-Lacoste (535_CR13) 2011; 38 535_CR33 H Aydilek (535_CR9) 2012; 219 535_CR32 X Li (535_CR20) 2018; 453 KR Baker (535_CR10) 2019 535_CR19 M Ciavotta (535_CR12) 2013; 227 R Ruiz (535_CR30) 2007; 177 535_CR38 MF Tasgetiren (535_CR36) 2017; 77 A Allahverdi (535_CR3) 2004; 31 V Tkindt (535_CR37) 2006 |
| References_xml | – volume: 6 start-page: 38 year: 2015 end-page: 44 ident: CR2 article-title: Total tardiness performance in m-machine no-wait flowshops with separate setup times publication-title: Intell Control Autom doi: 10.4236/ica.2015.61005 – volume: 31 start-page: 157 issue: 2 year: 2004 end-page: 180 ident: CR3 article-title: A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness publication-title: Comput Oper Res doi: 10.1016/S0305-0548(02)00143-0 – volume: 177 start-page: 2033 issue: 3 year: 2007 end-page: 2049 ident: CR30 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2005.12.009 – volume: 36 start-page: 139 issue: 1 year: 2014 end-page: 151 ident: CR25 article-title: New heuristics for the no-wait flowshop with sequence-dependent setup times problem publication-title: J Braz Soc Mech Sci Eng doi: 10.1007/s40430-013-0064-4 – volume: 20 start-page: 451 issue: 3 year: 2008 end-page: 471 ident: CR22 article-title: A review and evaluation of multiobjective algorithms for the flowshop scheduling problem publication-title: INFORMS J Comput doi: 10.1287/ijoc.1070.0258 – volume: 37 start-page: 149 issue: 3 year: 2012 end-page: 162 ident: CR1 article-title: Minimizing total tardiness in no-wait flowshops publication-title: Found Comput Decis Sci doi: 10.2478/v10209-011-0009-6 – volume: 365 start-page: 688 issue: 124 year: 2020 ident: CR7 article-title: No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan publication-title: Appl Math Comput – volume: 11 start-page: 91 issue: 1 year: 1983 end-page: 95 ident: CR27 article-title: A heuristic algorithm for the m-machine, n-job flowshop sequencing problem publication-title: Omega Int J Manag Sci doi: 10.1016/0305-0483(83)90088-9 – volume: 3 start-page: 43 year: 2016 end-page: 58 ident: CR21 article-title: The irace package: iterated racing for automatic algorithm configuration publication-title: Oper Res Perspect doi: 10.1016/j.orp.2016.09.002 – volume: 269 start-page: 590 issue: 2 year: 2018 end-page: 601 ident: CR6 article-title: No-wait flowshop scheduling problem with two criteria; total tardiness and makespan publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2017.11.070 – ident: CR33 – year: 2019 ident: CR10 publication-title: Principles of sequencing and scheduling – year: 2013 ident: CR14 publication-title: Flow shop scheduling. Theoretical results, algorithms, and applications doi: 10.1007/978-1-4614-5152-5 – volume: 453 start-page: 408 year: 2018 end-page: 425 ident: CR20 article-title: An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects publication-title: Inf Sci doi: 10.1016/j.ins.2018.04.038 – volume: 38 start-page: 1521 issue: 11 year: 2011 end-page: 1533 ident: CR23 article-title: Restarted iterated Pareto greedy algorithm for multi-objective flowshop scheduling problems publication-title: Comput Oper Res doi: 10.1016/j.cor.2011.01.010 – volume: 219 start-page: 351 issue: 1 year: 2012 end-page: 359 ident: CR9 article-title: Heuristics for no-wait flowshops with makespan subject to mean completion time publication-title: Appl Math Comput – volume: 238 start-page: 724 issue: 3 year: 2014 end-page: 734 ident: CR5 article-title: Total completion time with makespan constraint in no-wait flowshops with setup times publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2014.04.031 – volume: 38 start-page: 1219 issue: 8 year: 2011 end-page: 1236 ident: CR13 article-title: A hybrid tp plus pls algorithm for bi-objective flow-shop scheduling problems publication-title: Comput Oper Res doi: 10.1016/j.cor.2010.10.008 – ident: CR40 – volume: 53 start-page: 1 year: 2020 end-page: 19 ident: CR26 article-title: An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time publication-title: Eng Optim – year: 2016 ident: CR29 publication-title: Scheduling. Theory, algorithms, and systems – volume: 44 start-page: 41 year: 2014 end-page: 50 ident: CR28 article-title: An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem publication-title: Omega Int J Manag Sci doi: 10.1016/j.omega.2013.10.002 – year: 2006 ident: CR37 publication-title: Multicriteria scheduling: theory, models and algorithms – volume: 60 start-page: 27 year: 2015 end-page: 36 ident: CR15 article-title: Neh-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness publication-title: Comput Oper Res doi: 10.1016/j.cor.2015.02.002 – ident: CR42 – volume: 12 start-page: 415 issue: 4 year: 2021 end-page: 426 ident: CR39 article-title: Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance publication-title: Int J Ind Eng Comput – ident: CR19 – volume: 64 start-page: 278 issue: 2 year: 1993 end-page: 285 ident: CR35 article-title: Benchmarks for basic scheduling problems publication-title: Eur J Oper Res doi: 10.1016/0377-2217(93)90182-M – volume: 266 start-page: 840 issue: 3 year: 2018 end-page: 850 ident: CR17 article-title: Order scheduling with tardiness objective: improved approximate solutions publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2017.10.064 – ident: CR38 – volume: 44 start-page: 939 issue: 5 year: 2006 end-page: 957 ident: CR18 article-title: Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions publication-title: Int J Prod Res doi: 10.1080/00207540500282914 – volume: 27 start-page: 213 issue: 3 year: 2014 end-page: 228 ident: CR34 article-title: Solving the no-wait flow-shop problem with sequence-dependent set-up times publication-title: Int J Comput Integr Manuf doi: 10.1080/0951192X.2013.812802 – volume: 2 start-page: 155 issue: 1 year: 2011 end-page: 166 ident: CR8 article-title: A new effective heuristic method for the no-wait flowshop with sequence-dependent setup times problem publication-title: Int J Ind Eng Comput – ident: CR32 – volume: 68 start-page: 2237 issue: 9–12 year: 2013 end-page: 2251 ident: CR4 article-title: Algorithms for no-wait flowshops with total completion time subject to makespan publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-013-4836-x – volume: 227 start-page: 301 issue: 2 year: 2013 end-page: 313 ident: CR12 article-title: Multi-objective sequence dependent setup times permutation flowshop: a new algorithm and a comprehensive study publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2012.12.031 – volume: 77 start-page: 111 year: 2017 end-page: 126 ident: CR36 article-title: Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion publication-title: Comput Oper Res doi: 10.1016/j.cor.2016.07.002 – volume: 37 start-page: 3 issue: 1 year: 1999 end-page: 19 ident: CR11 article-title: Flow shop no-wait scheduling with sequence dependent setup times and release dates publication-title: INFOR Inf Syst Oper Res – volume: 99 start-page: 28 issue: 1–2 year: 2006 end-page: 40 ident: CR16 article-title: A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2004.12.004 – volume: 135 start-page: 79 year: 2019 end-page: 104 ident: CR24 article-title: Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization publication-title: Comput Ind Eng doi: 10.1016/j.cie.2019.05.034 – ident: CR41 – volume: 187 start-page: 1143 issue: 3 year: 2008 end-page: 1159 ident: CR31 article-title: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2006.07.029 – volume-title: Flow shop scheduling. Theoretical results, algorithms, and applications year: 2013 ident: 535_CR14 doi: 10.1007/978-1-4614-5152-5 – volume: 219 start-page: 351 issue: 1 year: 2012 ident: 535_CR9 publication-title: Appl Math Comput – volume: 453 start-page: 408 year: 2018 ident: 535_CR20 publication-title: Inf Sci doi: 10.1016/j.ins.2018.04.038 – volume: 31 start-page: 157 issue: 2 year: 2004 ident: 535_CR3 publication-title: Comput Oper Res doi: 10.1016/S0305-0548(02)00143-0 – ident: 535_CR40 doi: 10.1109/CCDC.2013.6561117 – volume: 2 start-page: 155 issue: 1 year: 2011 ident: 535_CR8 publication-title: Int J Ind Eng Comput – volume-title: Principles of sequencing and scheduling year: 2019 ident: 535_CR10 – volume: 38 start-page: 1521 issue: 11 year: 2011 ident: 535_CR23 publication-title: Comput Oper Res doi: 10.1016/j.cor.2011.01.010 – volume: 187 start-page: 1143 issue: 3 year: 2008 ident: 535_CR31 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2006.07.029 – volume: 37 start-page: 149 issue: 3 year: 2012 ident: 535_CR1 publication-title: Found Comput Decis Sci doi: 10.2478/v10209-011-0009-6 – volume: 365 start-page: 688 issue: 124 year: 2020 ident: 535_CR7 publication-title: Appl Math Comput – volume: 60 start-page: 27 year: 2015 ident: 535_CR15 publication-title: Comput Oper Res doi: 10.1016/j.cor.2015.02.002 – volume-title: Scheduling. Theory, algorithms, and systems year: 2016 ident: 535_CR29 – ident: 535_CR32 doi: 10.1016/j.ifacol.2015.06.315 – volume: 44 start-page: 41 year: 2014 ident: 535_CR28 publication-title: Omega Int J Manag Sci doi: 10.1016/j.omega.2013.10.002 – volume: 11 start-page: 91 issue: 1 year: 1983 ident: 535_CR27 publication-title: Omega Int J Manag Sci doi: 10.1016/0305-0483(83)90088-9 – volume: 238 start-page: 724 issue: 3 year: 2014 ident: 535_CR5 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2014.04.031 – ident: 535_CR38 doi: 10.1109/CSCWD.2012.6221909 – volume: 177 start-page: 2033 issue: 3 year: 2007 ident: 535_CR30 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2005.12.009 – volume: 68 start-page: 2237 issue: 9–12 year: 2013 ident: 535_CR4 publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-013-4836-x – ident: 535_CR41 doi: 10.1109/CSCWD.2013.6580989 – volume: 135 start-page: 79 year: 2019 ident: 535_CR24 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2019.05.034 – volume: 266 start-page: 840 issue: 3 year: 2018 ident: 535_CR17 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2017.10.064 – volume: 44 start-page: 939 issue: 5 year: 2006 ident: 535_CR18 publication-title: Int J Prod Res doi: 10.1080/00207540500282914 – volume: 38 start-page: 1219 issue: 8 year: 2011 ident: 535_CR13 publication-title: Comput Oper Res doi: 10.1016/j.cor.2010.10.008 – ident: 535_CR19 doi: 10.1007/11424925_50 – volume: 269 start-page: 590 issue: 2 year: 2018 ident: 535_CR6 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2017.11.070 – volume: 20 start-page: 451 issue: 3 year: 2008 ident: 535_CR22 publication-title: INFORMS J Comput doi: 10.1287/ijoc.1070.0258 – volume: 227 start-page: 301 issue: 2 year: 2013 ident: 535_CR12 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2012.12.031 – ident: 535_CR33 doi: 10.1080/00207543.2014.974846 – volume: 12 start-page: 415 issue: 4 year: 2021 ident: 535_CR39 publication-title: Int J Ind Eng Comput – volume: 64 start-page: 278 issue: 2 year: 1993 ident: 535_CR35 publication-title: Eur J Oper Res doi: 10.1016/0377-2217(93)90182-M – volume: 3 start-page: 43 year: 2016 ident: 535_CR21 publication-title: Oper Res Perspect doi: 10.1016/j.orp.2016.09.002 – volume: 36 start-page: 139 issue: 1 year: 2014 ident: 535_CR25 publication-title: J Braz Soc Mech Sci Eng doi: 10.1007/s40430-013-0064-4 – volume: 53 start-page: 1 year: 2020 ident: 535_CR26 publication-title: Eng Optim – volume: 99 start-page: 28 issue: 1–2 year: 2006 ident: 535_CR16 publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2004.12.004 – volume: 37 start-page: 3 issue: 1 year: 1999 ident: 535_CR11 publication-title: INFOR Inf Syst Oper Res – volume-title: Multicriteria scheduling: theory, models and algorithms year: 2006 ident: 535_CR37 – ident: 535_CR42 doi: 10.4028/www.scientific.net/AMR.933.459 – volume: 77 start-page: 111 year: 2017 ident: 535_CR36 publication-title: Comput Oper Res doi: 10.1016/j.cor.2016.07.002 – volume: 6 start-page: 38 year: 2015 ident: 535_CR2 publication-title: Intell Control Autom doi: 10.4236/ica.2015.61005 – volume: 27 start-page: 213 issue: 3 year: 2014 ident: 535_CR34 publication-title: Int J Comput Integr Manuf doi: 10.1080/0951192X.2013.812802 |
| SSID | ssj0033340 |
| Score | 2.3423502 |
| Snippet | In this article, we address the
m
-machine no-wait flow shop scheduling problem with sequence dependent setup times. The objective is to minimize total... In this article, we address the m-machine no-wait flow shop scheduling problem with sequence dependent setup times. The objective is to minimize total... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 31 |
| SubjectTerms | Business and Management Greedy algorithms Industrial and Production Engineering Job shop scheduling Multiple criterion Operations research Operations Research/Decision Theory Optimization Research Paper Setup times Upper bounds |
| SummonAdditionalLinks | – databaseName: SpringerLINK - Czech Republic Consortium dbid: AGYKE link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwEB1Be4EDO6JQ0By4gVEaO05zrBAFgeBEJThFduOwlaRqU1Xq1zNZTAsCJK5ZrMRje96zZ94AHEtiHYpoA_McQQRFtfqM_LpiXMQEODT3WnG-oX97J6964vrBe6iSwsY22t0eSRYr9UKym0tWJR_DClES5i9DvdDbqkG9c_l4c2FXYM55mQhJ5IAJz3GqZJmfW_nqkOYo89vBaOFvuuvQs19ahpm8nU0yfdaffRNx_O-vbMBaBUCxU46YTVgyyRasLsgSbsOsk6AppCXII2Gpu2wiJGZOSzKqwVM6esme35HwLiosQhJZql_LpROTlE3VS4bxIJ3i-DkdYlW0BvM9X7Sx22jL72Z0KZsMsahyvwO97sX9-RWrajSwPjHDjOl8zkc6CoRDRI_AWOTKqK3J_IaQiR_oQGupFBfKVW6sCW_EUgeBkb4IfBM7fBdqSZqYPUDPEPRo-9oEIhbaidpcu05bCSJIAZcyakDLGirsVwLmeR2NQTiXXs77NaR-DYt-Df0GnHy-MyzlO_58umntH1ZTeRzy_BBK5mXiG3BqzTm__Xtr-_97_ABWXAJMZXxbE2rZaGIOCfBk-qga3x_ZDfSE priority: 102 providerName: Springer Nature |
| Title | An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times |
| URI | https://link.springer.com/article/10.1007/s10288-023-00535-7 https://www.proquest.com/docview/3030967143 |
| Volume | 22 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 1614-2411 dateEnd: 20241105 omitProxy: true ssIdentifier: ssj0033340 issn: 1619-4500 databaseCode: BENPR dateStart: 20030301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Technology Collection customDbUrl: eissn: 1614-2411 dateEnd: 20241105 omitProxy: true ssIdentifier: ssj0033340 issn: 1619-4500 databaseCode: 8FG dateStart: 20030301 isFulltext: true titleUrlDefault: https://search.proquest.com/technologycollection1 providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK - Czech Republic Consortium customDbUrl: eissn: 1614-2411 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0033340 issn: 1619-4500 databaseCode: AGYKE dateStart: 20030101 isFulltext: true titleUrlDefault: http://link.springer.com providerName: Springer Nature – providerCode: PRVAVX databaseName: SpringerLink Journals (ICM) customDbUrl: eissn: 1614-2411 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0033340 issn: 1619-4500 databaseCode: U2A dateStart: 20030301 isFulltext: true titleUrlDefault: http://www.springerlink.com/journals/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3fT9swED5B-7I9TAM2rRtU98DbZi2NHSd5mKYOtSDQqgmtEnuK7Nrhh7qkG0FI--t3TmwKSPCaH5aSs---s---D2BfUtahKG1gSSQoQVGjBaO4rhgXJQEOzZNR6Tb0v8_k0VwcnyVnGzALvTCurDL4xNZRm3rh9sg_c3cWIJ1a99fVH-ZUo9zpapDQUF5awXxpKcY2oR87Zqwe9L9NZj9Og2_mnHctkpQ2MJFEkW-j8c10Mc0aimGsJT1h6cNQtcafj45M20g0fQ2vPITEcWfzLdiw1Ta8vEcsuAP_xhXalhyCYgp2zMnWIOXW5FRRLc_py5qL30iIFRW2RYWs1led88OqZrfqssFyWd_i9UW9Qi87g27XFkP1NQYB3YYuNTcrbHXq38B8Ovl5cMS8ygJbUG7XMO1WrdEmFxGlagSnTCxNpsmAlrBFmutca6kUFypWcakJMZRS57mVqchTW0b8LfSqurLvABNL4CFLtc1FKXRkMq7jKFOCUpycS2kGMAo_tFh4CnKnhLEs1uTJzggFGaFojVCkA_h4986qI-B49undYKfCL8brYj11BvAp2G59--nR3j8_2gd4ERPE6SrSdqHX_L2xewRRGj2EzWx6OIT--PDXyWToZyFdncfj_zS15Hg |
| linkProvider | ProQuest |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1NT9wwEB3R5dByQPRLLNB2Du2ptZqNHWdzQBUU0FJgVVUgcUvttVOKlmTbDVrBj-tv6zix2YJUbhw3m1iKZ-J5z555A_BWEutQRBtYEgkiKKo3YhTXFeOiIMChedIr3Ib-0VAOTsSX0-R0Af6EWhiXVhnWxGahNtXI7ZF_5O4sQLpu3Z8mv5jrGuVOV0MLDeVbK5jNRmLMF3Yc2KsZUbjp5v4O2ftdHO_tHn8eMN9lgI2I29RMO6812mQiIqpCcMLE0vQ1vYCl2JpmOtNaKsWFilVcaIqYhdRZZmUqstQWEadxH8Gi4PSzA4vbu8Ov30Is4Jy3JZlEU5hIosiX7fjivZi8lGIma0RWWHo7NM7x7p0j2iby7a3AsoesuNX62FNYsOUzWPpHyPA5XG-VaBsxCoph2Co1W4PE5WkRRzX-QTNZn10gIWRU2CQxskqft4stlhWbqZ81FuNqhtOzaoK-zQ26XWIM2d4YGvbWdKm-nGDtyldewMmDzPdL6JRVaVcBE0tgpZ9qm4lC6Mj0uY6jvhJEqTIupelCL0xoPvKS567zxjifizU7I-RkhLwxQp524f3NM5NW8OPeuzeCnXL_8U_zuat24UOw3fzv_4-2dv9ob-Dx4PjoMD_cHx6sw5OY4FWbDbcBnfr3pX1F8KjWr70PInx_aLf_C38aHZ4 |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFA46QfRBvOJ06nnwTcO6Jk3Xx6GOeRs-ONhbSdbUTWZbto6Bv96TXtwUFXztJdB-uXxfcs53CDkXqDokygbqWBwFimwMKK7rkjIeIuFQzGmEZkP_sSs6PX7Xd_pLWfxZtHt5JJnnNBiXpiitJ0FYX0p8sxFhXG9oZlBC3VWyxo1RAvbont0q52LGWJ4SiTKBcseyirSZn9v4ujQt-Oa3I9Js5Wlvk62CMkIrx3iHrOhol2wuGQnukfdWBDozg8BvgNwpWQeAWhonUZDjl3gySodvgAwVJGRBhDRWr_lkB1FM53KUQjiO5zAdxgkUZWbA7NJCGW0NZcHcFC-lswSyuvT7pNe-eb7q0KKqAh2glkupMqM0UIHHLZRmSJ8CWwRNhYBp5BKupzylhJSMS1vaoUKGEArleVq43HN1aLEDUoniSB8ScDSShaartMdDrqygyZRtNSVHSeMxIYIqaZQ_1B8UluOm8sXYX5glGxB8BMHPQPDdKrn4fCfJDTf-fLpW4uQXg2_qM3NsJExh9yq5LLFb3P69taP_PX5G1p-u2_7Dbff-mGzYyHby4LQaqaSTmT5BtpKq06xDfgBL1t6r |
| 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+efficient+iterated+greedy+algorithm+for+a+multi-objective+no-wait+flow+shop+problem+with+sequence+dependent+setup+times&rft.jtitle=4OR&rft.date=2024-03-01&rft.pub=Springer+Nature+B.V&rft.issn=1619-4500&rft.eissn=1614-2411&rft.volume=22&rft.issue=1&rft.spage=31&rft.epage=45&rft_id=info:doi/10.1007%2Fs10288-023-00535-7 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1619-4500&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1619-4500&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1619-4500&client=summon |