Solving the University Timetabling Problem Considering Teachers’ Preferences: Modeling and Solution Using Binary Integer Programming

Abstract

The University Timetabling Problem (UTP) poses a significant challenge for educational institutions worldwide, involving the scheduling of teaching activities while considering various constraints and objectives. This paper addresses the UTP by incorporating teachers' preferences into the timetabling process, aiming to create an efficient timetable that meets standard constraints and satisfies teachers' preferences. We propose a binary integer linear programming model to solve the University Timetabling Problem Considering Teachers' Preference (UTPTP). The model's objective function is designed to accurately reflect teachers' priorities by assigning weights to preference orders, and normalization is employed to scale down preferences. Implementing the model in a case study for the Statistics Program at the Faculty of Science, Prince of Songkla University, demonstrates its capability to accommodate various scenarios while meeting teachers' preferences. Manual adjustments post-solution further refine the timetable, ensuring practical considerations are adequately addressed. This combined approach provides a robust framework for solving the teaching timetable problem, offering flexibility and adaptability to different institutional contexts and requirements.