A Variable Block Insertion Heuristic for the Energy-Efficient Permutation Flowshop Scheduling with Makespan Criterion

Basit Öğe Kaydı
dc.authorscopusid6505799356
dc.authorscopusid57194232319
dc.authorscopusid15074237600
dc.authorscopusid55926629500
dc.authorscopusid57220960559
dc.contributor.authorTasgetiren, M.F.
dc.contributor.authorOztop, H.
dc.contributor.authorPan, Q.-K.
dc.contributor.authorOrnek, M.A.
dc.contributor.authorTemizceri, T.
dc.date.accessioned2024-07-18T20:16:43Z
dc.date.available2024-07-18T20:16:43Z
dc.date.issued2021
dc.description.abstractPermutation flow shop scheduling problem is a well-known problem in the scheduling literature. Even though various multi-objective permutation flowshop scheduling problems have been studied in the literature, energy consumption consideration in scheduling is still very seldom. In this paper, we consider a bi-objective permutation flowshop scheduling problem with the objectives of minimizing the total energy consumption and the makespan. We present a bi-objective mixed integer programming model for the problem applying a speed-scaling approach. Then, we employ the augmented ? -constraint method to generate the Pareto-optimal solution sets for small-sized instances. For larger instances, we use the augmented ? -constraint method with a time limit on CPLEX solver to approximate the Pareto frontiers. We also propose a heuristic approach, which employs a very recent variable block insertion heuristic algorithm. In order to evaluate performance of the proposed algorithm, we have carried out detailed computational experiments using well-known benchmarks from the literature. First, we present the performance of the proposed algorithm on small-sized problems; then, we show that the proposed algorithm is very effective to solve larger problems as compared with the time-limited CPLEX. © 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.en_US
dc.identifier.doi10.1007/978-3-030-58930-1_3
dc.identifier.endpage49en_US
dc.identifier.issn1860-949X
dc.identifier.scopus2-s2.0-85097956206en_US
dc.identifier.scopusqualityQ4en_US
dc.identifier.startpage33en_US
dc.identifier.urihttps://doi.org/10.1007/978-3-030-58930-1_3
dc.identifier.urihttps://hdl.handle.net/11411/6209
dc.identifier.volume906en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherSpringer Science and Business Media Deutschland GmbHen_US
dc.relation.ispartofStudies in Computational Intelligenceen_US
dc.relation.publicationcategoryKitap Bölümü - Uluslararasıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.titleA Variable Block Insertion Heuristic for the Energy-Efficient Permutation Flowshop Scheduling with Makespan Criterionen_US
dc.typeBook Chapteren_US

Dosyalar

Koleksiyon

Scopus Indexed Publications