M. Fatih TasgetirenDamla YukselLiang GaoQuan-Ke PanPeigen LiYuksel, DamlaTasgetiren, M. FatihGao, LiangLi, PeigenFatih Tasgetiren, M.Pan, Quan-KeCH DagliGA Suer2025-10-0620192351-978910.1016/j.promfg.2020.01.3472-s2.0-85082759822http://dx.doi.org/10.1016/j.promfg.2020.01.347https://gcris.yasar.edu.tr/handle/123456789/7656https://doi.org/10.1016/j.promfg.2020.01.347No-wait permutation flow shop scheduling problem (NWPFSP) is a variant of permutation flow shop scheduling problem (PFSP) where the processing of each job must be continuous from start to end without any interruption. That is once a job starts its processing it has to be processed until the last machine without any interruption. The aim of this study is to propose an energy-efficient NWPFSP for the determination of a trade-off between total flow time and total energy consumption by obtaining the Pareto optimal set that is the non-dominated solution set. A bi-objective mixed-integer programming model is developed where the machines can operate at different speed levels. Since the problem is NP-complete an energy-efficient discrete artificial bee colony (DABC) and an energy-efficient genetic algorithm (MOGA) also a variant of this algorithm (MOGALS) are developed as heuristic methods. First the performance of these algorithms for comparison with the mathematical model is represented in small size instances in the scope of cardinality and quality of the non-dominated solutions then it is shown that DABC performs better than two other algorithms in larger instances. (C) 2019 The Authors. Published by Elsevier Ltd.Englishinfo:eu-repo/semantics/openAccessno-wait permutation flow shop scheduling problem, heuristic optimization, bi-objective optimization, energy-efficient schedulingSWARM OPTIMIZATION ALGORITHM, ITERATED GREEDY ALGORITHM, CONSUMPTION, MAKESPAN, HEURISTICS, TIMEBi-Objective OptimizationEnergy-Efficient SchedulingNo-Wait Permutation Flow Shop Scheduling ProblemHeuristic OptimizationConference Object