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 1110 (Eberle)

The first lecture is on Monday, October 23, 2017.
The first exercise class is on Monday, October 30, 2017 and starts at 16:00 (sharp).
Date Topic Material
23/10/2017 Introduction, three field notation, single machine, Smith's rule orga slides, introduction
30/10/2017 Single machine: 1|(prec)|L_max (EDF), 1|prec|f_max (Lawler's algorithm) notes
06/11/2017 Single machine: 1||sum U_j (Moore Hodgson), parallel machines: P||sum C_j (SPT), R||sum C_j (matching), P|pmtn|C_max (McNaughton Wrap around)
13/11/2017 no lecture, no exercise

Lecture Notes: For writing the lecture notes in LaTeX, please use this template together with the package scribe. If you have troubles accessing the lecture notes, please send an email to Franziska.

Homework: Please hand in the exercises before the lecture on the indicated date with your name and immatriculation number written on your solution.
Exercise Sheet Hand in in the lecture on Exercise Class
Exercise 1 October 30 October 30
Exercise 2 November 6 November 6
Exercise 3 November 20 November 20
Exercise 4 November 27 November 27
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.