Scheduling Theory

Course in Winter 2017/18

Scheduling involves the timely allocation of tasks to scarce resources with the objective to minimize some cost function. Such problems appear in various applications, e.g., in production planning, logistics, project management, or when operating computing systems. This lecture will cover: a classification of scheduling models, complexity of scheduling problems, the design and analysis of exact and approximation algorithms, single and parallel machine models, flow shop and open shop problems. The focus lies on the design and mathematical analysis of algorithms using combinatorial techniques, dynamic programming and linear programming.

Prof. Dr. Nicole Megow (Email)
M.Sc. Franziska Eberle (Email)
Time & Room:

Lecture: Mon 14-16 in room MZH 1110 (Megow)
Exercise: Mon 16-18 in room MZH 1100 (Eberle)

The first lecture is on Monday, October 23, 2017.
Literature: The course is based on parts of the literature below and recent research articles that will be added later.
  • M. L. Pinedo. Scheduling: Theory, Algorithms, and Systems. Springer, 2012.
  • J. Y.-T. Leung. Handbook of Scheduling: Algorithms, Models, and Performance Analysis. Chapman & Hall/CRC, 2004.
  • F. Jaehn and E. Pesch: Ablaufplanung. Einführung in Scheduling. Springer, 2014.