An energy-efficient permutation flowshop scheduling problem

Basit Öğe Kaydı
dc.authoridPan, Quan-ke / 0000-0002-5022-7946
dc.authoridKandiller, Levent / 0000-0002-7300-5561
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.authorscopusid6506822666
dc.authorwosidPan, Quan-ke/F-2019-2013
dc.authorwosidKandiller, Levent/B-3392-2019
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.contributor.authorKandiller, Levent
dc.date.accessioned2022-02-15T16:58:19Z
dc.date.available2022-02-15T16:58:19Z
dc.date.issued2020
dc.departmentBakırçay Üniversitesien_US
dc.description.abstractThe permutation flowshop scheduling problem (PFSP) has been extensively explored in scheduling literature because it has many real-world industrial implementations. In some studies, multiple objectives related to production efficiency have been considered simultaneously. However, studies that consider energy consumption and environmental impacts are very rare in a multi-objective setting. In this work, we studied two contradictory objectives, namely, total flowtime and total energy consumption (TEC) in a green permutation flowshop environment, in which the machines can be operated at varying speed levels corresponding to different energy consumption values. A bi-objective mixed-integer programming model formulation was developed for the problem using a speed-scaling framework. To address the conflicting objectives of minimizing TEC and total flowtime, the augmented epsilon-constraint approach was employed to obtain Pareto-optimal solutions. We obtained near approximations for the Pareto-optimal frontiers of small-scale problems using a very small epsilon level. Furthermore, the mathematical model was run with a time limit to find sets of non-dominated solutions for large instances. As the problem was NP-hard, two effective multi-objective iterated greedy algorithms and a multi-objective variable block insertion heuristic were also proposed for the problem as well as a novel construction heuristic for initial solution generation. The performance of the developed heuristic algorithms was assessed on well-known benchmark problems in terms of various quality measures. Initially, the performance of the algorithms was evaluated on small-scale instances using Pareto-optimal solutions. Then, it was shown that the developed algorithms are tremendously effective for solving large instances in comparison to time-limited model. (C) 2020 Elsevier Ltd. All rights reserved.en_US
dc.description.sponsorshipHuazhong University of Science and Technology (HUST) Project in Wuhan, China; National 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 Huazhong University of Science and Technology (HUST) Project in Wuhan, 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 valuable suggestions and comments.en_US
dc.identifier.doi10.1016/j.eswa.2020.113279
dc.identifier.issn0957-4174
dc.identifier.issn1873-6793
dc.identifier.scopus2-s2.0-85079326964en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.urihttps://doi.org/10.1016/j.eswa.2020.113279
dc.identifier.urihttps://hdl.handle.net/20.500.14034/386
dc.identifier.volume150en_US
dc.identifier.wosWOS:000528193700007en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherPergamon-Elsevier Science Ltden_US
dc.relation.journalExpert Systems With Applicationsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectPermutation flowshop scheduling problemen_US
dc.subjectMulti-objective optimizationen_US
dc.subjectEnergy-efficient schedulingen_US
dc.subjectHeuristic algorithmsen_US
dc.subjectTotal Weighted Tardinessen_US
dc.subjectIterated Greedy Algorithmen_US
dc.subjectDependent Setup Timesen_US
dc.subjectSingle-Machineen_US
dc.subjectPower-Consumptionen_US
dc.subjectMemetic Algorithmen_US
dc.subjectLocal Searchen_US
dc.subjectJob-Shopen_US
dc.subjectMakespanen_US
dc.subjectHeuristicsen_US
dc.titleAn energy-efficient permutation flowshop scheduling problemen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
An energy-efficient permutation flowshop scheduling problem.pdf
Boyut:
2.3 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