Hauptinhalt
Topinformationen
Complex Scheduling Problems
Allgemeine Informationen
- Veranstaltungsart
- Vorlesung
- Semester
- SoSe 2005
- ECTS-Punkte
- 6,00
- Veranstaltungsnummer
- 6.712
- Details
- Link zur Veranstaltung in StudIP
Dozent*innen
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.
Studienbereiche
- Anwendungsfächer > Informatik
- Mathematik/Informatik > Informatik > SS > Hauptstudium
- Cognitive Science > Bachelor-Programm
- Cognitive Science > Master-Programm
- Informatik > Vorlesungen
