Energy Aware Scheduling for Unrelated Parallel Machines

We consider the problem of energy aware scheduling of a set of jobs on a set of unrelated parallel machines with the average weighted completion time plus energy objective. The processing time and the energy consumption of the jobs are machine and speed dependent. Also, every job is subject to a mac...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2012 IEEE/ACM International Conference on Green Computing and Communications s. 533 - 540
Hlavní autoři: Angel, E., Bampis, E., Kacem, F.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.11.2012
Témata:
approximation algorithm
Approximation algorithms
Approximation methods
Computational modeling
Energy consumption
Polynomials
Program processors
randomization
Schedules
scheduling
unrelated machines
weighted completion time
ISBN:9781467351461, 1467351466
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider the problem of energy aware scheduling of a set of jobs on a set of unrelated parallel machines with the average weighted completion time plus energy objective. The processing time and the energy consumption of the jobs are machine and speed dependent. Also, every job is subject to a machine-dependent release date. Firstly, we aim to find a non-preemptive schedule of the jobs minimizing the average weighted completion time plus energy, and we propose a randomized approximation algorithm that we derandomize obtaining a deterministic approximation algorithm. We then consider the budget variant of the problem where the objective is to minimize the average completion time while the total energy consumption does not exceed a given budget.
ISBN:9781467351461
1467351466
DOI:10.1109/GreenCom.2012.78