A constructive approach to examination timetabling based on adaptive decomposition and ordering

In this study, we investigate an adaptive decomposition and ordering strategy that automatically divides examinations into difficult and easy sets for constructing an examination timetable.The examinations in the difficult set are considered to be hard to place and hence are listed before the ones in the easy set in the construction process. Moreover, the examinations within each set are ordered using different strategies based on graph colouring heuristics.Initially, the examinations are placed into the easy set. During the construction process, examinations that cannot be scheduled are identified as the ones causing infeasibility and are moved forward in the difficult set to ensure earlier assignment in subsequent attempts.On the other hand, the examinations that can be scheduled remain in the easy set.Within the easy set, a new subset called the boundary set is introduced to accommodate shuffling strategies to change the given ordering of examinations.The proposed approach, which incorporates different ordering and shuffling strategies, is explored on the Carter benchmark problems.The empirical results show that the performance of our algorithm is broadly comparable to existing constructive approaches