Hauptinhalt

Topinformationen

Complex Scheduling Problems

Informationen

Veranstaltungsnummer:: 6.712
Veranstaltungsart:: Vorlesung
StudIP:: https://studip.uni-osnabrueck.de/dispatch.php/course/details/?again=1&sem_id=1b517acf85a361f389de1ac02bd088fb
Semester:: SoSe 2005
ECTS-Punkte:: 6,00
Voraussetzungen:

Dozent*innen

Prof. Dr. Sigrid Knust

Beschreibung

http://www2.inf.uos.de/kombopt/lehre/csp.htm

We study complex scheduling problems (resource-constrained project scheduling, generalized shop scheduling problems, timetabling, sports league scheduling) and efficient solution methods for them (local search methods, constrained propagation, linear programming, branch-and-bound algorithms, genetic algorithms).

In all these problems we are given a set of activities (jobs) which have to be processed for a certain time. During processing they need some additional resources (machines, people, energy, money) which are available with limited capacities. The main problem consists in finding a schedule which satisfies the resource constraints and minimizes a certain objective function. Examples for such problems can be found in production planning, school timetabling, railway scheduling, sports league scheduling, etc.