A cut-and-branch algorithm for the external candidates examination scheduling problem

DOI10.1007/S10951-024-00833-WMaRDI QIDQ6883938zbMATH OpenFDO

Authors Pasquale Avella, Maurizio Boccia, Carlo Mannino, Michele Mele, Sandro Viglione

Publication date 16 December 2025

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

Full work available at URL https://doi.org/10.1007/S10951-024-00833-W

zbMATH Keywords

cut-and-branchschedulingseparation algorithmvalid inequalities

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• A cellular memetic algorithm for the examination timetabling problem
• A column generation approach for solving the examination-timetabling problem
• A practical three‐phase ILP approach for solving the examination timetabling problem
• A step counting hill climbing algorithm applied to university examination timetabling
• A survey of search methodologies and automated system development for examination timetabling
• Educational timetabling: problems, benchmarks, and state-of-the-art results
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems
• Practices in timetabling in higher education institutions: a systematic review
• Real-life examination timetabling
• Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling

This page was built for publication: A cut-and-branch algorithm for the external candidates examination scheduling problem

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