Fairness in academic course timetabling

DOI10.1007/s10479-014-1553-2zbMath1336.90078arXiv1303.2860OpenAlexW3103164964MaRDI QIDQ284412

Rolf Wanka, Moritz Mühlenthaler

Publication date: 18 May 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.2860

zbMATH Keywords

curriculum-based course timetablingfairness indexmax-min fairness

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27)

Related Items (11)

Fairness in academic course timetabling ⋮ Operational research in education ⋮ A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem ⋮ A cellular memetic algorithm for the examination timetabling problem ⋮ Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem ⋮ Matching and scheduling of student-company-talks for a university it-speed dating event ⋮ A quest for a fair schedule: the international Young Physicists' Tournament ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ Diameter of colorings under Kempe changes ⋮ Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system ⋮ An overview of curriculum-based course timetabling

Uses Software

• Hyperheuristics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Fairness in academic course timetabling
• Curriculum-based course timetabling with SAT and MaxSAT
• Hybrid variable neighbourhood approaches to university exam timetabling
• 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
• Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
• The Price of Fairness
• Rate control for communication networks: shadow prices, proportional fairness and stability
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
• Quadratic bottleneck problems
• Bottleneck extrema
• Fairness in routing and load balancing

This page was built for publication: Fairness in academic course timetabling