Binary integer programming model for university courses timetabling: a case study

It is proposed a binary integer programming model to handle a real instance of the courses-to-professors timetabling problem. The optimization criteria is the preferences of professors by courses and schedules. Besides the common set of constraints, specific features of this situation are considered. A coefficient is introduced to decide about different optimal solutions (alternatively and independently of the approach used in the model). The model was successfully applied in semesters 2014.2 and 2015.1, by the Departamento de Estatística of the Universidade Federal de Pernambuco.