Credits 6 credit points
Instructors Vredeveld, T. (Universiteit Maastricht)
Prerequisites Basic knowledge (bachelor level) of analysis and linear algebra.
Aim This course gives an introduction into scheduling theory and its applications.
Description The term scheduling represents the assignment of resources over time to perform 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 many of these problems are hard (NP-hard). In this course an overview on the most classical scheduling models is given and exact as well as some optimal and some heuristic solution methods are discussed for these models.
In detail, the following issues are treated:
- Classification of scheduling models
- Single-machine models
- Parallel-machines models
- Open shop, flow shop and job shop models
- Timetabling
- Transportation
- On-line models.
Organization 12 Lectures
Examination Take home problems and an examination (oral or written).

- Handout for special subjects.

The following books can be used as background and further information, but do not have to be bought:
- 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.

  Last changed: 05-03-2015 16:29