Finding near optimal solutions to the thesis defense timetabling problem by exploiting symmetries

DOI10.1007/S43069-024-00346-4MaRDI QIDQ6579104zbMATH OpenFDO

Authors Angelos Dimitsas, Christos Gogos

Publication date 25 July 2024

Published in SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S43069-024-00346-4

zbMATH Keywords

constraint programmingschedulingsymmetriesthesis defense timetabling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A constraint-based approach to the timetabling problem
• Models and algorithms for school timetabling -- a constraint-programming approach
• Solving a real constraint satisfaction model for the university course timetabling problem: a case study
• University timetabling by constraint-based reasoning: A case study
• Optimal block design models for course timetabling

Cites work

• A survey of search methodologies and automated system development for examination timetabling
• Scheduling EURO-k conferences
• Trivial integer programs unsolvable by branch-and-bound

This page was built for publication: Finding near optimal solutions to the thesis defense timetabling problem by exploiting symmetries

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