Fairness in academic course timetabling
From MaRDI portal
Publication:284412
DOI10.1007/S10479-014-1553-2zbMATH Open1336.90078arXiv1303.2860OpenAlexW3103164964MaRDI QIDQ284412FDOQ284412
Authors: Moritz Mühlenthaler, Rolf Wanka 
Publication date: 18 May 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/1303.2860
Recommendations
- An overview of curriculum-based course timetabling
- A new model for curriculum-based university course timetabling
- Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study
- A strategic view of university timetabling
- Curriculum based course timetabling: new solutions to Udine benchmark instances
Cites Work
- Optimization by simulated annealing
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- The price of fairness
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multi-criteria bandwidth allocation
- Bottleneck extrema
- A robust simulated annealing based examination timetabling system.
- Fast, fair and frugal bandwidth allocation in ATM networks
- A branch-and-cut procedure for the Udine course timetabling problem
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- ITC2007 solver description: a hybrid approach
- Adaptive tabu search for course timetabling
- A graph-based hyper-heuristic for educational timetabling problems
- Lexicographic maximin optimisation for fair bandwidth allocation in computer networks
- Neighborhood portfolio approach for local search applied to timetabling problems
- Fairness in academic course timetabling
- Setting the research agenda in automated timetabling: the second international timetabling competition
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
- Curriculum-based course timetabling with SAT and MaxSAT
- Quadratic bottleneck problems
- Fairness in routing and load balancing
- Hybrid variable neighbourhood approaches to university exam timetabling
Cited In (12)
- An overview of curriculum-based course timetabling
- Fair student placement
- Fairness in academic course timetabling
- Operational research in education
- A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem
- Diameter of colorings under Kempe changes
- Matching and scheduling of student-company-talks for a university it-speed dating event
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
- A quest for a fair schedule: the international Young Physicists' Tournament
- Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system
- A cellular memetic algorithm for the examination timetabling problem
- Educational timetabling: problems, benchmarks, and state-of-the-art results
Uses Software
This page was built for publication: Fairness in academic course timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284412)
