Exact and metaheuristic methods for a real-world examination timetabling problem
Publication:6136080
DOI10.1007/S10951-023-00778-6zbMath1520.90097OpenAlexW4368362725MaRDI QIDQ6136080
Thomas J. R. Stidsen, Rasmus Ørnstrup Mikkelsen, Luca Di Gaspero, Andrea Schaerf, Sara Ceschia, Mats Carlsson
Publication date: 28 August 2023
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-023-00778-6
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Real-life examination timetabling
- A column generation approach for solving the examination-timetabling problem
- A two-stage decomposition of high school timetabling applied to cases in Denmark
- Mathematical models and algorithms for a high school timetabling problem
- Preprocessing and an improved MIP model for examination timetabling
- Optimal speedup of Las Vegas algorithms
- A survey of search methodologies and automated system development for examination timetabling
- Integer programming for the generalized high school timetabling problem
- The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution
- Partitioning procedures for solving mixed-variables programming problems
- A cellular memetic algorithm for the examination timetabling problem
- An integer programming approach to curriculum-based examination timetabling
- Auto-tabling for subproblem presolving in MiniZinc
- Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- Efficient solutions for a university timetabling problem through integer programming
- Local search and constraint programming for a real-world examination timetabling problem
- Matheuristics. Algorithms and implementations
- Propagation via lazy clause generation
- Feature-based tuning of single-stage simulated annealing for examination timetabling
- A mixed-integer mathematical modeling approach to exam timetabling
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- An Adaptive Flex-Deluge Approach to University Exam Timetabling
- Algorithm 457: finding all cliques of an undirected graph
- A practical three‐phase ILP approach for solving the examination timetabling problem
This page was built for publication: Exact and metaheuristic methods for a real-world examination timetabling problem
