License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-25435
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2543/
Go to the corresponding Portal


Khuller, Samir ; Li, Jian ; Saha, Barna

Energy Efficient Scheduling via Partial Shutdown

pdf-format:
Document 1.pdf (305 KB)


Abstract

We define a collection of new problems referred to as ``machine activation'' problems. The central framework we introduce considers a collection of M machines (unrelated or related), with machine $i$ having an activation cost of $a_i$. There is also a collection of N jobs that need to be performed, and $p_{ij}$ is the processing time of job $j$ on machine $i$. Standard scheduling models assume that the set of machines is fixed and all machines are available. We assume that there is an activation cost budget of $A$ -- we would like to select a subset S of the machines to activate with total cost $a(S)le A$ and find a schedule for the jobs on the machines in $S$ minimizing the makespan. In this work we develop bi-criteria approximation algorithms for this problem based on both LP rounding and a greedy approach.

BibTeX - Entry

@InProceedings{khuller_et_al:DSP:2010:2543,
  author =	{Samir Khuller and Jian Li and Barna Saha},
  title =	{Energy Efficient Scheduling via Partial Shutdown},
  booktitle =	{Scheduling},
  year =	{2010},
  editor =	{Susanne Albers and Sanjoy K. Baruah and Rolf H. M{\"o}hring and Kirk Pruhs},
  number =	{10071},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2543},
  annote =	{Keywords: Unrelated parallel machine scheduling, approximation algorithms}
}

Keywords: Unrelated parallel machine scheduling, approximation algorithms
Seminar: 10071 - Scheduling
Issue Date: 2010
Date of publication: 03.05.2010


DROPS-Home | Fulltext Search | Imprint Published by LZI