Linear Integer Model for the Course Timetabling Problem of a Faculty in Rio de Janeiro

Abstract EN

This work presents a linear integer programming model that solves a timetabling problem of a faculty in Rio de Janeiro, Brazil.

The model was designed to generate solutions that meet the preferences of the faculty’s managers, namely, allocating the maximum number of lecturers with highest academic title and minimising costs by merging courses with equivalent syllabuses.

The integer linear model also finds solutions that meet lecturers’ scheduling preferences, thereby generating more practical and comfortable schedules for these professionals.

Preferences were represented in the objective function, each with a specific weight.

The model outperformed manual solutions in terms of response time and quality.

The model was also able to demonstrate that lecturers’ scheduling preferences are actually conflicting goals.

The model was approved by the faculty’s managers and has been used since the second semester of 2011.