Research Institute for Discrete Mathematics

Lecture Course "SCHEDULING"

Summer 2010

Lecturer: T. Nieberg
Class Hours: Tuesdays 10:15-11:45
Room: Gerhard-Konow-Hörsaal (in the Arithmeum building, Lennéstr. 2)

The term scheduling represents the assignment of resources over time to perform some tasks, jobs or activities. Feasible schedules are compared with respect to a given optimality criterion. Mostly, the optimization problem is combinatorial and very complex. From a computational point of view these problems are hard (NP-hard) and the classical techniques fail in practice. Therefore, an optimal solution is often approximated. The following topics will be discussed:
Suggested reading: