A Survey of Solution Methodologies for Exam Timetabling Problems

Abstract

Exam timetabling is a prominent topic in academic administration management as it ensures the effective utilization of resources and satisfies the requirements and preferences of stakeholders, which leads to a productive academic environment, contributing to the institution’s overall success. Given the myriad of solution methodologies explored across diverse exam timetabling problems and constraints, both in studied benchmark datasets and real-life cases over the last decade, there is an imperative to undertake a comprehensive survey. This survey paper aims to comprehensively describe the exam timetabling problem (ETP), including its variants, constraints, and benchmark dataset. We look at different methods to solve ETP problems from 2012 to 2023. These methods include mathematical optimization, heuristics, metaheuristics, hyper-heuristics, hybrid approaches, and matheuristics. Finally, we discuss the review findings and potential research directions. By doing so, we hope to facilitate a deeper understanding of ETP and offer valuable insights for future research.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 25 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.