.png){kind=icon}
返回
A memetic differential evolution algorithm for energy-efficient parallel machine scheduling
.png){kind=icon}
PRE
AI
DOI：10.1016/j.omega.2018.01.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers an energy-efficient bi-objective unrelated parallel machine scheduling problem to minimize both makespan and total energy consumption. The parallel machines are speed-scaling. To solve the problem, we propose a memetic differential evolution (MDE) algorithm. Since the problem involves assigning jobs to machines and selecting an appropriate processing speed level for each job, we characterize each individual by two vectors: a job-machine assignment vector and a speed vector. To accelerate the convergence of the algorithm, only the speed vector of each individual evolves and a list scheduling heuristic is applied to derive its job-machine assignment vector based on its speed vector. To further enhance the algorithm, we propose efficient speed adjusting and job-machine swap heuristics and integrate them into the algorithm as a local search approach by an adaptive meta-Lamarckian learning strategy. Computational results reveal that the incorporation of list scheduling heuristic and local search greatly strengthens the algorithm. Computational experiments also show that the proposed MDE algorithm outperforms SPEA-II and NSGA-II significantly. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Energy-efficient scheduling
Unrelated parallel machines
Memetic algorithm
Differential evolution
List scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
O
IF:
7.2
论文数:
3.7K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
Single machine total completion time scheduling problem with workload-dependent maintenance duration
PREAI
分享收藏Energy-efficient bi-objective single-machine scheduling with power-down mechanism具有掉电机制的高能效双目标单机调度
PREAI
分享收藏分享收藏
查看更多内容