Examination timetabling is a problem well known to the scheduling community. Its simplest version, which is the uncapacitated examination timetabling problem, is easily described and comprehended. Nevertheless, proof of optimality is notoriously difficult even for moderate size problems. In this paper, we describe the effort that our team exercised in finally proving the optimality of the sta83 instance of Carter’s dataset. The problem was decomposed naturally in three parts and for each part a different approach managed to prove optimality of the currently best known solution. This work also presents optimal solutions to subproblems that exist in various public datasets problems and two best known solutions of such problems.
CITATION STYLE
Dimitsas, A., Gogos, C., Valouxis, C., Nastos, V., & Alefragis, P. (2024). A proven optimal result for a benchmark instance of the uncapacitated examination timetabling problem. Journal of Scheduling. https://doi.org/10.1007/s10951-024-00805-0
Mendeley helps you to discover research relevant for your work.