On the Examination Timetabling Problem at TH Nürnberg, Dept. of Computer Science

  • This report examines the Examination Timetabling Problem (ETP) at the Department of Computer Science (IN) at Technische Hochschule Nürnberg (THN), focusing on the specific constraints and challenges of the institution. The report surveys various algorithms and approaches applied to solve the ETP. The Step Counting Hill Climbing (SCHC) algorithm, originally proposed by Bykov and Petrovic, is highlighted as a particularly effective solution. The report details the implementation and enhancements of the SCHC algorithm at IN, which has been successfully applied to the department's timetabling needs. Experimental results demonstrate that the SCHC algorithm, with its simplicity and efficiency, produces high-quality timetables within minutes, comparable to manually created schedules. The report also discusses the limitations of integer linear programming for real-world ETPs due to its exponential complexity. The findings suggest that the SCHC algorithm is well-suited for the ETP at IN, with potential for further optimisation to improveThis report examines the Examination Timetabling Problem (ETP) at the Department of Computer Science (IN) at Technische Hochschule Nürnberg (THN), focusing on the specific constraints and challenges of the institution. The report surveys various algorithms and approaches applied to solve the ETP. The Step Counting Hill Climbing (SCHC) algorithm, originally proposed by Bykov and Petrovic, is highlighted as a particularly effective solution. The report details the implementation and enhancements of the SCHC algorithm at IN, which has been successfully applied to the department's timetabling needs. Experimental results demonstrate that the SCHC algorithm, with its simplicity and efficiency, produces high-quality timetables within minutes, comparable to manually created schedules. The report also discusses the limitations of integer linear programming for real-world ETPs due to its exponential complexity. The findings suggest that the SCHC algorithm is well-suited for the ETP at IN, with potential for further optimisation to improve speed and solution quality.…show moreshow less

Download full text files

Export metadata

Additional Services

Search Google Scholar
Metadaten
Author:Friedhelm StappertORCiD
URN:urn:nbn:de:bvb:92-opus4-46904
DOI:https://doi.org/10.34646/thn/ohmdok-4690
Document Type:Report
Language:English
Date of first Publication:2026/03/03
Publishing Institution:Technische Hochschule Nürnberg Georg Simon Ohm
Release Date:2026/03/04
Tag:Examination Timetabling; Optimisation
Pagenumber:26
institutes:Fakultät Informatik
Research Themes:Digitalisierung & Künstliche Intelligenz
Licence (German):Keine Lizenz - Deutsches Urheberrecht gilt
Verstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.