Energy Aware Scheduling for Unrelated Parallel Machines

Eric Angel (1) , Evripidis Bampis (2) , Fadi Kacem (1)

1 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
2 RO - Recherche Opérationnelle

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.

Domains: Computer Science [cs]; Modeling and Simulation

Eric Angel, Evripidis Bampis, Fadi Kacem. Energy Aware Scheduling for Unrelated Parallel Machines. IEEE International Conference on Green Computing and Communications (GreenCom 2012), Nov 2012, Besançon, France. pp.533--540, ⟨10.1109/GreenCom.2012.78⟩. ⟨hal-00785112⟩