Prüfungsplanung mit optimierter Raumzuordnung

The scope of examination timetabling is to schedule a certain number 
of exams within a given time horizon and to minimize the number of 
overlaps for the students at the same time. During the planning process 
many conflicting restrictions have to be considered simultaneously:   
On the one hand there are restrictions due to the limited capacity of
rooms and the lecturers' preferences, and on the other hand rules for
an appropriate schedule have to be followed.

This thesis deals with examination timetabling where
especially the assignment of exams to rooms is considered.
The scheduling problem is modelled as a resource-constrained project
scheduling problem  (RCPSP), where exams are the jobs and 
the given time horizon is split into slots. The jobs have to be assigned 
to the slots while the required resources (as students, lecturers and 
rooms) do not exceed the available capacity. An attempt to solve this 
RCPSP is made by developing different algorithms based on local search 
methods. On the basis of data of the University of Osnabrück these 
methods are analyzed and evaluated.