Fairness in Academic Course Timetabling

2015
ISBN: 978-3-319-12798-9
Verlag: Springer International Publishing

Buch, Englisch, Band 678, 147 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 2584 g

Reihe: Lecture Notes in Economics and Mathematical Systems

This monograph deals with theoretical and practical aspects of creating course timetables at academic institutions. The task is typically to create a timetable that suits the requirements of the stakeholders – students, lecturers, and the administration – as well as possible. The book presents an exposition of the basic combinatorial problems and solution methods for course timetabling and related tasks. It provides a rigorous treatment of fairness issues that arise in the course timetabling context and shows how to deal with the potentially conflicting interests of the stakeholders. The proposed methods are also readily applicable to other classes of scheduling problems such as staff rostering. Finally, it presents a comprehensive case study on the implementation of an automated course timetabling system at the school of engineering of the University of Erlangen-Nuremberg. The case study includes a detailed description of the problem model as well as an evaluation of stakeholder satisfaction.

Zielgruppe

Research

Autoren/Hrsg.

Mühlenthaler, Moritz

Fachgebiete

• Sozialwissenschaften Pädagogik Schulen, Schulleitung Universitäten, Hochschulen
• Interdisziplinäres Wissenschaften Wissenschaften Interdisziplinär Universitäten, Wissenschaftliche Akademien, Gelehrtengesellschaften

Inhaltsverzeichnis

Introduction.- The University Course Timetabling Problem.- Fairness in Academic Course Timetabling.- Real-world Academic Course Timetabling.- Appendix.

Über Autor(innen)

Moritz Mühlenthaler holds a Bachelor of Science (Honours) in Computer Science from the University of Adelaide and a Diploma in Computer Science from the University of Erlangen-Nürnberg. He was a doctoral student at the Efficient Algorithms and Combinatorial Optimization group at the University of Erlangen-Nürnberg and finished his Doctor of Engineering (Dr.-Ing.) in 2014. His research interests include graph-theoretic concepts in computer science in general, and timetabling and scheduling problems in particular.