A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption

摘要

In this paper, we consider a scheduling problem on multiple speed-scalable processors, where the objective is to minimize a weighted sum of total completion times of jobs and total energy consumption on processors. We propose a simple algorithm for the scheduling problem that runs faster than the existing algorithm. (C) 2020 Elsevier B.V. All rights reserved.