Although educational timetabling problems have been studied for decades, one instance of this, the school timetabling problem (STP), has not developed as quickly as examination timetabling and course timetabling problems due to its diversity and complexity. In addition, most STP research has only focused on the educators’ availabilities when studying the educator aspect, and the educators’ preferences and expertise have not been taken into consideration. To fill in this gap, this paper proposes a conceptual model for the school timetabling problem considering educators’ availabilities, preferences and expertise as a whole. Based on a common real-world school timetabling scenario, the artificial bee colony (ABC) algorithm is adapted to this study, as research shows its applicability in solving examination and course timetabling problems. A virtual search space for dealing with the large search space is introduced to the proposed model. The proposed approach is simulated with a large, randomly generated dataset. The experimental results demonstrate that the proposed approach is able to solve the STP and handle a large dataset in an ordinary computing hardware environment, which significantly reduces computational costs. Compared to the traditional constraint programming method, the proposed approach is more effective and can provide more satisfactory solutions by considering educators’ availabilities, preferences, and expertise levels.

Although educational timetabling problems have been studied for decades, one type, the STP, has not developed as quickly as the other two types due to its diversity and complexity. Also, most of the STP research has only focused on the educators’ availabilities when studying the educator aspect, and the educators’ preferences and expertise have not been taken into consideration. This paper proposes a conceptual model for the school timetabling problem considering educators’ availabilities, preferences and expertise as a whole, and chooses a common real-world school timetabling scenario to study. A mathematical model is presented. A Virtual search space for dealing with the large search space is introduced, and the artificial bee colony algorithm is adapted and applied to the proposed model. The proposed approach is simulated with a random-generated large dataset. The experimental results demonstrate that the proposed approach is able to solve the STP and handle a large dataset in an ordinary computer hardware environment, which significantly reduces computational costs. Compared to the traditional CP method, the proposed approach is more effective and can provide more satisfactory solutions in considering educators’ availabilities, preferences, and expertise levels.