publication . Doctoral thesis . 2016

Algorithmen für klassische und moderne Planungsprobleme

Ott, Sebastian;
Open Access English
  • Published: 01 Jan 2016
  • Publisher: Universität des Saarlandes
  • Country: Germany
Abstract
Subject of this thesis is the design and the analysis of algorithms for scheduling problems. In the first part, we focus on energy-efficient scheduling, where one seeks to minimize the energy needed for processing certain jobs via dynamic adjustments of the processing speed (speed scaling). We consider variations and extensions of the standard model introduced by Yao, Demers, and Shenker in 1995 [79], including the addition of a sleep state, the avoidance of preemption, and variable speed limits. In the second part, we look at classical makespan scheduling, where one aims to minimize the time in which certain jobs can be completed. We consider the restricted ass...
Subjects
free text keywords: Scheduling, Approximation, Ablaufplanung, Algorithmus, graph balancing, restricted assignment, speed scaling, ddc:004, ddc:620
Related Organizations
Any information missing or wrong?Report an Issue