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

Time: Wednesday, 14:00 - 16:00
Place: FAV Hörsaal 3 Zemanek (Seminarraum Zemanek) (except 30.10.2019, Seminarraum 127)
Lecturer: Ass.Prof. Dr. Sascha Hunold
TUWEL course:
All students should be present at the preliminary meeting, which also gives an introduction to the topic.

Exercises and exam

Material / Slides

All slides will be made available for download on TUWEL.

Lectures

Literature

Michael L. Pinedo. Scheduling - Theory, Algorithms, and Systems. 3rd ed. Springer, 2008
Maciej Drozdowski. Scheduling for Parallel Processing. Springer, 2009
Joseph Y-T. Leung, ed. Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman & Hall/CRC, 2004
Peter Brucker. Scheduling algorithms. 5th ed. Springer, 2007
Florian Jaehn and Erwin Pesch. Ablaufplanung. Springer, 2014
Oliver Sinnen. Task Scheduling for Parallel Systems. Wiley, 2007
Yves Robert and Frédéric Vivien, eds. Introduction to Scheduling. Chapman & Hall/CRC, 2010