Fairness in Academic Course Timetabling

Moritz Mühlenthaler
Additional contact information
Moritz Mühlenthaler: University of Erlangen-Nuremberg

Chapter Chapter 3 in Fairness in Academic Course Timetabling, 2015, pp 75-105 from Springer

Abstract: Abstract In this chapter we will focus on models and algorithms for creating fair course timetables. For this purpose we consider the distribution of the timetable quality over the stakeholders. We propose two different problem formulations based on different fairness models: lexicographic max-min fairness and jain’s fairness index. We further propose and evaluate a Simulated Annealing-based algorithm for creating optimized timetables in the first model and investigate the tradeoff between fairness and overall timetable quality using the second model.

Keywords: Assignment Problem; Soft Constraint; Fairness Index; Timetabling Problem; Total Penalty (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-319-12799-6_3

Ordering information: This item can be ordered from
http://www.springer.com/9783319127996

DOI: 10.1007/978-3-319-12799-6_3

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().