2026-08-16T20:57:52Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2543 2024-03-06T11:09:10Z ddc:004 open_access

Energy Efficient Scheduling via Partial Shutdown Khuller, Samir Li, Jian Saha, Barna Unrelated parallel machine scheduling approximation algorithms 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Samir Khuller and Jian Li and Barna Saha 2010 Is Part Of Dagstuhl Seminar Proceedings, Volume 10071, Scheduling (2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.10071.5 urn:nbn:de:0030-drops-25435 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10071.5 eng https://creativecommons.org/licenses/by/4.0/legalcode