A proven optimal result for a benchmark instance of the uncapacitated examination timetabling problem

DOI10.1007/S10951-024-00805-0MaRDI QIDQ6956303zbMATH OpenFDO

Authors Angelos Dimitsas, Christos Gogos, Christos Valouxis, Vasileios Nastos, Panayiotis Alefragis

Publication date 18 July 2025

Published in Journal of Scheduling (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10951-024-00805-0

zbMATH Keywords

examination timetablingheuristicsmixed integer programming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Cites work

• A cellular memetic algorithm for the examination timetabling problem
• A survey of search methodologies and automated system development for examination timetabling
• Julia: a fresh approach to numerical computing
• Models and solution techniques for frequency assignment problems
• Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling

This page was built for publication: A proven optimal result for a benchmark instance of the uncapacitated examination timetabling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956303)