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

DOI10.1007/S43069-024-00346-4zbMATH Open1543.90091MaRDI QIDQ6579104

Angelos Dimitsas, Christos Gogos

Publication date: 25 July 2024

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

zbMATH Keywords

schedulingsymmetriesconstraint programmingthesis defense timetabling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Scheduling EURO-k conferences
• A survey of search methodologies and automated system development for examination timetabling
• 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)