.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Energy-efficient scheduling
Unrelated parallel machines
Memetic algorithm
Differential evolution
List scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
O
IF:
7.2
Papers:
3.7K
Citations:
1.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveSingle machine total completion time scheduling problem with workload-dependent maintenance duration
PREAI
ShareSaveShareSaveShareSave
View more