• Corpus ID: 18012885

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

@article{Mhlenthaler2013ADO,
  title={A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem},
  author={Moritz M{\"u}hlenthaler and Rolf Wanka},
  journal={ArXiv},
  year={2013},
  volume={abs/1306.5601}
}
We propose a decomposition of the max-min fair curriculum-based course timetabling (MMF-CB-CTT) problem. The decomposition models the room assignment subproblem as a generalized lexicographic bottleneck optimization problem (LBOP). We show that the generalized LBOP can be solved efficiently if the corresponding sum optimization problem can be solved efficiently. As a consequence, the room assignment subproblem of the MMF-CB-CTT problem can be solved efficiently. We use this insight to improve a… 

Figures from this paper

A two-phase heuristic and a lexicographic rule for improving fairness in personnel rostering
TLDR
A new fairness objective and an effective two-phase heuristic for optimizing rosters, taking into consideration the established personnel rostering constraints and the fairness are proposed.

References

SHOWING 1-10 OF 46 REFERENCES
Curriculum based course timetabling: new solutions to Udine benchmark instances
TLDR
An integer programming approach to the university course timetabling problem, in which weekly lectures have to be scheduled and assigned to rooms, which is very robust in the sense that it deterministically gives satisfactory lower and upper bounds in reasonable computation time without particular tuning.
A branch-and-cut procedure for the Udine Course Timetabling problem
TLDR
A branch-and-cut procedure for the Udine Course Timetabling problem is described, which gives a formulation with fewer variables by using a mix of binary and general integer variables.
Adaptive Tabu Search for course timetabling
Fairness measures for resource allocation
  • Amit Kumar, J. Kleinberg
  • Computer Science
    Proceedings 41st Annual Symposium on Foundations of Computer Science
  • 2000
TLDR
This work considers the problem of producing solutions that simultaneously approximate all feasible allocations in a coordinate-wise sense, and explores its consequences in a range of discrete optimization problems, including facility location, scheduling, and bandwidth assignment in networks.
Faster Scaling Algorithms for Network Problems
This paper presents algorithms for the assignment problem, the transportation problem, and the minimum-cost flow problem of operations research. The algorithms find a minimum-cost solution, yet run
Assignment Problems
TLDR
This book provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments and can serve as a text for advanced courses in discrete mathematics, integer programming, combinatorial optimization, and algorithmic computer science.
Lexicographic bottleneck problems
...
1
2
3
4
5
...