Enhancing the Sorting Layers in the Initial Stage of High School Timetabling

• Main Authors: Arbaoui, Billel, Wahid, Juliana, Abdul-Rahman, Syariza
• Format: Conference or Workshop Item
• Language: English
• Published: 2020
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://repo.uum.edu.my/27227/1/ISCAIE%202020%2059%2063.pdf; http://repo.uum.edu.my/27227/; http://doi.org/10.1109/ISCAIE47305.2020.9108804
• Institution: Universiti Utara Malaysia

The high school timetabling problem (HSTP) is considered as an NP-Complete problem as the optimal solution for it, is still not discovered by any algorithm. Generally, NP-Complete problem was solved firstly by constructing the initial solution, in the construction phase. The initial solution will be improvised in the improvisation phase. KHE is an algorithm that generates initial solution of HSTP. The layer sorting procedure in KHE is based on a certain priority. For every two layers, the layers will be ranked based on the highest value of duration. If both layers have equal value of duration, the layer with the highest value of demand will be at a higher rank. If both layers have equal value of demand. The layer will be arranged according to the index value of the layer. These sorting criteria use the layer properties independently which causes non-good results after the time-assignment phase. Therefore, this study proposed a mathematical model based on the Markov Chain Model for the sorting procedure that combines the layer properties in a formula. The proposed model was executed with 40 datasets of XHSTT2014, and it shows better results on 25 datasets of XHSTT2014 compared to the KHE algorithm. The mathematical model based on Markov Chain proposed in this study is able to improvise the original sorting of KHE.