Journal
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
Volume 82, Issue -, Pages 155-165Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.omega.2018.01.001
Keywords
Energy-efficient scheduling; Unrelated parallel machines; Memetic algorithm; Differential evolution; List scheduling
Funding
- National Natural Science Foundation of China [71471145, 71071129]
- Natural Science Foundation of Shaanxi Province of China [2017JM7014]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available