Metaheuristic algorithms for the hybrid flowshop scheduling problem

Basit Öğe Kaydı
dc.authoridPan, Quan-ke / 0000-0002-5022-7946
dc.authoridTursel Eliiyi, Deniz / 0000-0001-7693-3980
dc.authoridTasgetiren, Mehmet Fatih / 0000-0002-5716-575X
dc.authorscopusid57194232319
dc.authorscopusid6505799356
dc.authorscopusid14521079300
dc.authorscopusid15074237600
dc.authorwosidPan, Quan-ke/F-2019-2013
dc.authorwosidTursel Eliiyi, Deniz/J-9518-2014
dc.contributor.authorÖztop, Hande
dc.contributor.authorTaşgetiren, M. Fatih
dc.contributor.authorEliiyi, Deniz Türsel
dc.contributor.authorPan, Quan-Ke
dc.date.accessioned2022-02-15T16:58:19Z
dc.date.available2022-02-15T16:58:19Z
dc.date.issued2019
dc.departmentBakırçay Üniversitesien_US
dc.description.abstractThe hybrid flowshop scheduling problem (HFSP) has been widely studied in the literature, as it has many real-life applications in industry. Even though many solution approaches have been presented for the HFSP with makespan criterion, studies on HFSP with total flow time minimization have been rather limited. This study presents a mathematical model, four variants of iterated greedy algorithms and a variable block insertion heuristic for the HFSP with total flow time minimization. Based on the well-known NEH heuristic, an efficient constructive heuristic is also proposed, and compared with NEH. A detailed design of experiment is carried out to calibrate the parameters of the proposed algorithms. The HFSP benchmark suite is used for evaluating the performance of the proposed methods. As there are only 10 large instances in the current literature, further 30 large instances are proposed as new benchmarks. The developed model is solved for all instances on CPLEX under a time limit, and the performances of the proposed algorithms are assessed through comparisons with the results from CPLEX and the two best-performing algorithms in literature. Computational results show that the proposed algorithms are very effective in terms of solution time and quality. Additionally, the proposed algorithms are tested on large instances for the makespan criterion, which reveal that they also perform superbly for the makespan objective. Especially for instances with 30 jobs, the proposed algorithms are able to find the current incumbent makespan values reported in literature, and provide three new best solutions. (C) 2019 Elsevier Ltd. All rights reserved.en_US
dc.description.sponsorshipNational Natural Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [51435009]en_US
dc.description.sponsorshipM. Fatih Tasgetiren and Quan-Ke Pan acknowledge the HUST Project in Wuhan in China. They are supported by the National Natural Science Foundation of China (grant no: 51435009). The authors would also like to thank the anonymous referees for their insightful comments on a previous version of the paper.en_US
dc.identifier.doi10.1016/j.cor.2019.06.009
dc.identifier.endpage196en_US
dc.identifier.issn0305-0548
dc.identifier.issn1873-765X
dc.identifier.scopus2-s2.0-85068125455en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage177en_US
dc.identifier.urihttps://doi.org/10.1016/j.cor.2019.06.009
dc.identifier.urihttps://hdl.handle.net/20.500.14034/385
dc.identifier.volume111en_US
dc.identifier.wosWOS:000483411600013en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherPergamon-Elsevier Science Ltden_US
dc.relation.journalComputers & Operations Researchen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectHybrid flowshop schedulingen_US
dc.subjectBlock insertion heuristicen_US
dc.subjectIterated greedy algorithmen_US
dc.subjectMakespanen_US
dc.subjectTotal flow timeen_US
dc.subjectSequence-Dependent Setupen_US
dc.subjectIterated Greedy Algorithmen_US
dc.subjectLocal Searchen_US
dc.subjectBound Algorithmen_US
dc.subjectShopen_US
dc.subjectOptimizationen_US
dc.subjectBranchen_US
dc.subjectMachineen_US
dc.subject2-Stageen_US
dc.subjectTimesen_US
dc.titleMetaheuristic algorithms for the hybrid flowshop scheduling problemen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
Metaheuristic algorithms for the hybrid flowshop scheduling problem.pdf
Boyut:
3.44 MB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Endüstri Mühendisliği Bölümü Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu