A Variable Block Insertion Heuristic for the Energy-Efficient Permutation Flowshop Scheduling with Makespan Criterion
Küçük Resim Yok
Tarih
2021
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Springer Science and Business Media Deutschland GmbH
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Permutation 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.
Açıklama
Anahtar Kelimeler
Kaynak
Studies in Computational Intelligence
WoS Q Değeri
Scopus Q Değeri
Q4
Cilt
906
