4.5 Article

An NSGA-II-Based Memetic Algorithm for an Energy-Efficient Unrelated Parallel Machine Scheduling Problem with Machine-Sequence Dependent Setup Times and Learning Effect

期刊

ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING
卷 47, 期 3, 页码 3773-3788

出版社

SPRINGER HEIDELBERG
DOI: 10.1007/s13369-021-06114-4

关键词

Energy-efficient unrelated parallel machine scheduling; Speed scaling mechanism; Machine-sequence dependent setup times; Learning effect; Multiobjective evolutionary memetic algorithm

向作者/读者索取更多资源

This study focuses on an energy-efficient unrelated parallel machine scheduling problem, incorporating speed scaling as an energy-efficient strategy. It proposes a multiobjective MILP model and a NSGA-II-based memetic algorithm for the problem.
In this study, an energy-efficient unrelated parallel machine scheduling problem is discussed. The speed scaling mechanism has been taken into account as an energy-efficient strategy. Unrelated parallel machine scheduling with speed scaling is generalized by considering machine-sequence dependent setup times and learning effect features. A multiobjective mixed-integer linear programming (MILP) model has been proposed for the problem. Due to the NP-hard nature of the problem, a multiobjective evolutionary algorithm, the NSGA-II-based memetic algorithm, is proposed. An encoding scheme, decoding algorithm, and local search algorithms are proposed for the problem. Speed tuning heuristic and job-machine switch heuristic algorithms are proposed as local search algorithms. A restarting strategy has been applied to ensure the diversification of the algorithm. The classical NSGA-II algorithm and the proposed memetic algorithm were compared over the generated test problems. As a result, the proposed memetic algorithm is more successful according to performance metrics.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据