Important
Timetabling is the allocation, subject to constraints, of given resources to objects being placed in space-time, in such way as to satisfy as nearly as possible a set of desirable objectives.
A. Wren. Scheduling, timetabling and rostering - A special relationship? In Edmund Burke and Peter Ross, editors, Practice and Theory of Automated Timetabling, volume 1153 of Lecture Notes in Computer Science, pages 46-75. Springer Berlin / Heidelberg, 1996
Note
An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear.
Wikipedia: Integer programming
- A Cutting Plane Algorithm for the International Timetabling Competition 2019 Problem, Management and Economics Report
- A graph-based MIP formulation of the International Timetabling Competition 2019, Journal of Scheduling
- A mixed-integer programming approach for solving university course timetabling problems, Journal of Scheduling
- Mixed Integer Programming for University Timetabling, Ph.D. Thesis
- Application of Mixed Integer Programming Methods for Practical Educational Timetabling, Ph.D. Thesis
- MILP. Try. Repeat. Computing solutions to the ITC 2021 instances by repeated massive parallel MILP computations, Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2021
- Solving a highly constrained Dutch school timetabling problem, Master Thesis
- A MIP Formulation of the International Timetabling Competition 2019 Problem, Management and Economics Report
- Integer programming for the generalized high school timetabling problem, Journal of Scheduling