Fairness in Academic Course Timetabling

  • Moritz Mühlenthaler

Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 678)

Table of contents

  1. Front Matter
    Pages i-xiv
  2. Moritz Mühlenthaler
    Pages 1-9
  3. Moritz Mühlenthaler
    Pages 11-73
  4. Moritz Mühlenthaler
    Pages 75-105
  5. Moritz Mühlenthaler
    Pages 107-128
  6. Back Matter
    Pages 129-147

About this book

Introduction

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.

Keywords

Kempe Insertion Heuristic Kempe-exchange operation UCTP combinatorial optimization graph theory problem decomposition timetabling

Authors and affiliations

  • Moritz Mühlenthaler
    • 1
  1. 1.Lehrstuhl für Informatik 12University of Erlangen-NurembergErlangenGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-12799-6
  • Copyright Information Springer International Publishing Switzerland 2015
  • Publisher Name Springer, Cham
  • eBook Packages Business and Economics
  • Print ISBN 978-3-319-12798-9
  • Online ISBN 978-3-319-12799-6
  • Series Print ISSN 0075-8442
  • Series Online ISSN 2196-9957
  • About this book