Fairness in Academic Course Timetabling

03/12/2013
by   Moritz Mühlenthaler, et al.
0

We consider the problem of creating fair course timetables in the setting of a university. Our motivation is to improve the overall satisfaction of individuals concerned (students, teachers, etc.) by providing a fair timetable to them. The central idea is that undesirable arrangements in the course timetable, i.e., violations of soft constraints, should be distributed in a fair way among the individuals. We propose two formulations for the fair course timetabling problem that are based on max-min fairness and Jain's fairness index, respectively. Furthermore, we present and experimentally evaluate an optimization algorithm based on simulated annealing for solving max-min fair course timetabling problems. The new contribution is concerned with measuring the energy difference between two timetables, i.e., how much worse a timetable is compared to another timetable with respect to max-min fairness. We introduce three different energy difference measures and evaluate their impact on the overall algorithm performance. The second proposed problem formulation focuses on the tradeoff between fairness and the total amount of soft constraint violations. Our experimental evaluation shows that the known best solutions to the ITC2007 curriculum-based course timetabling instances are quite fair with respect to Jain's fairness index. However, the experiments also show that the fairness can be improved further for only a rather small increase in the total amount of soft constraint violations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2013

A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem

We propose a decomposition of the max-min fair curriculum-based course t...
research
06/28/2019

Rényi Fair Inference

Machine learning algorithms have been increasingly deployed in critical ...
research
09/25/2014

Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem

We consider the university course timetabling problem, which is one of t...
research
05/17/2017

Efficient max-min and proportional fair constrained multiresource scheduling

We consider the problem of scheduling a group of heterogeneous, distribu...
research
05/17/2017

Scheduling Distributed Resources in Heterogeneous Private Clouds

We first consider the static problem of allocating resources to ( i.e. ,...
research
11/11/2021

Fairness-aware Crowdsourcing of IoT Energy Services

We propose a Novel Fairness-Aware framework for Crowdsourcing Energy Ser...
research
06/06/2019

Fair Division Without Disparate Impact

We consider the problem of dividing items between individuals in a way t...

Please sign up or login with your details

Forgot password? Click here to reset