Algorithms for classical and modern scheduling problems

Doctoral thesis English OPEN
Ott, Sebastian;
  • Identifiers: doi: 10.22028/D291-25430
  • Subject: Scheduling | Approximation | Ablaufplanung | Algorithmus | scheduling | graph balancing | restricted assignment | speed scaling
    • ddc: ddc:004 | ddc:620

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 s... View more
Share - Bookmark