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)

Outline:
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:

Classification of scheduling models
Single-machine models
Parallel-machines models
Open shop, flow shop and job shop models
Timetabling
Transportation
On-line models

Slides:

Suggested reading:

Pinedo, Michael L: Planning and Scheduling in Manufacturing and Services; Series: Springer Series in Operations Research and Financial Engineering, 2005, With CD-ROM., Hardcover, ISBN: 0-387-22198-0
Brucker, Peter: Scheduling Algorithms 4th ed., 2004, Springer Verlag Berlin, Hardcover, ISBN: 3-540-20524-1
Pinedo, Michael L: Scheduling: Theory, Algorithms, and Systems; 2nd ed., 2002, Prentice Hall, ISBN 0-13-028138-7

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