*Result*: Educational timetabling problem with teaching load assignment using preferences and compactness.

*The educational timetabling problem is well known for its complexity and difficulty, making it a time-consuming task for many institutions. Consequently, a variety of approaches have been developed to address this problem. This research presents a novel integer linear programming model that incorporates features to maintain a sustainable relationship between the institution and its professors in the long term. These features involve faculty considerations and preferences. The mathematical model is applied to solve a course timetabling problem at a Mexican university, where the faculty is mainly composed of part-time professors. In addition to determining the allocation of professors to courses within specific time slots for groups of students, we also address the issue of teaching load, which is determined by the number of courses assigned to each professor. This results in a specific number of class hours per week, a value constrained to ensure the compactness of professors' schedules and the balancing of assigned courses and class hours for the same group. These conditions are treated as hard constraints to emphasize their importance and ensure compliance. The final timetable maximizes the total preference of course-professor assignments based on professors' preferences and previous academic performance evaluations. In all cases, an optimal solution was obtained in a short time (seconds), significantly reducing the time required to process this task and providing solutions with optimal preference in course-professor assignments. An analysis and discussion comparing the obtained solution with the handmade case are presented. [ABSTRACT FROM AUTHOR]*

*Full text is not displayed to guests* *Login for full access*