Integer programming techniques for educational timetabling
By George H. G. Fonseca, Haroldo Gambini Santos, Eduardo G. Carrano, Thomas J. R. Stidsen. 2017
38 citations recorded by the source corpus.
Educational timetabling problems require the assignment of times and resources to events, while sets of required and desirable constraints must be considered. The XHSTT format was adopted in this work because it models the main features of educational timetabling and it is the most used format in recent studies in the field. This work presents new cuts and reformulations for the existing integer programming model for XHSTT. The proposed cuts improved hugely the linear relaxation of the formulation, leading to an average gap reduction of 32%. Applied to XHSTT-2014 instance set, the alternative formulation provided four new best known lower bounds and, used in a matheuristic framework, improved eleven best known solutions. The computational experiments also show that the resulting integer programming models from the proposed formulation are more effectively solved for most of the instances.
Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering, Management Science and Operations Research
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Industrial and Manufacturing Engineering
In Management Science and Operations Research
Citations in the corpus
- Optimal Decision Trees for the Algorithm Selection Problem: Integer Programming Based Approaches (2019, background): “, 2016), School Timetabling (Fonseca et al., 2017) and Graph Drawing (Silva and Santos, 2017) were also included.”