Maximizing timeslots preference of school time tabling problem using integer linear programming / Nurul Liyana Abdul Aziz, Nurul Izzah Sani and Nurul Izzati Zahari

The school timetabling problem is a complex task that requires the allocation of resources and scheduling of classes to meet the preferences of both students and teachers. Integer linear programming (ILP) is proposed in this study where the objective is to generate a school timetable model while maximizing the timeslots preference of the school timetable using Excel solver. This study will demonstrate how well the ILP method works at generating the school timetable that maximizes the timeslots preference while complying with all the limitations. The school timetable data from a secondary school in Kedah is taken into consideration. The finding demonstrates that ILP technique can generate a timetable at the most preferred timeslot. As a result, the generated timetable by Excel Solver produced a school timetable without any clashes and all the class meetings are assigned to the most preferred timeslots.