A Linear Solution for the University Timetabling Problem

The University Timetabling problem deals with scheduling courses and determining the lecturer and the location of each course in a semester. This problem belongs to NP-Hard problems, which means that solving the problem requires smart algorithms. In this paper, we propose a linear formulation of the problem which has been implemented using the GLPG modeling language.