Lecture: Parallel Algorithms - Scheduling

Overview

The course gives an introduction into the basics of scheduling theory, but will also highlight practical aspects when solving scheduling problems. The course introduces basic concepts and notation used in scheduling research. Then, selected topics are discussed in more detail, such as: shop scheduling, scheduling with parallel tasks, online scheduling, approximation algorithms in scheduling, divisible load scheduling, simulation and scheduling.

Information

Exercises and exam

Material / Slides

All slides will be made available for download on TUWEL.

Lectures

  1. Tuesday, 02.10.2018: Preliminaries and Introduction
  2. Wednesday, 10.10.2018:
  3. Wednesday, 17.10.2018:
  4. Wednesday, 24.10.2018:
  5. Wednesday, 31.10.2018:
  6. Wednesday, 07.11.2018:
  7. Wednesday, 14.11.2018: no lecture
  8. Wednesday, 21.11.2018:
  9. Wednesday, 28.11.2018:
  10. Wednesday, 05.12.2018:
  11. Wednesday, 12.12.2018:
  12. Wednesday, 19.12.2018:
  13. Wednesday, 26.12.2018: Lecture free (Christmas)
  14. Wednesday, 02.01.2019: Lecture free (Christmas)
  15. Wednesday, 09.01.2019:
  16. Wednesday, 16.01.2019:
  17. Wednesday, 23.01.2019:
  18. Wednesday, 30.01.2019: Lecture free (exam week)

Literature