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

Podrobná bibliografia

Vydané v:	2012 IEEE/ACM International Conference on Green Computing and Communications s. 533 - 540
Hlavní autori:	Angel, E., Bampis, E., Kacem, F.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.11.2012
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!