Educational timetabling: problems, benchmarks, and state-of-the-art results
From MaRDI portal
Publication:6167390
DOI10.1016/J.EJOR.2022.07.011arXiv2201.07525OpenAlexW4285039452WikidataQ114184261 ScholiaQ114184261MaRDI QIDQ6167390FDOQ6167390
Sara Ceschia, Andrea Schaerf, Luca Di Gaspero
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Abstract: We propose a survey of the research contributions on the field of Educational Timetabling with a specific focus on "standard" formulations and the corresponding benchmark instances. We identify six of such formulations and we discuss their features, pointing out their relevance and usability. Other available formulations and datasets are also reviewed and briefly discussed. Subsequently, we report the main state-of-the-art results on the selected benchmarks, in terms of solution quality (upper and lower bounds), search techniques, running times, statistical distributions, and other side settings.
Full work available at URL: https://arxiv.org/abs/2201.07525
Recommendations
- A review of hyper-heuristics for educational timetabling
- A graph-based hyper-heuristic for educational timetabling problems
- scientific article; zbMATH DE number 1786131
- Integer programming techniques for educational timetabling
- Towards constraint-based school timetabling
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Models and algorithms for school timetabling -- a constraint-programming approach
- scientific article; zbMATH DE number 1322611
Cites Work
- RobinX: a three-field classification and unified data format for round-robin sports timetabling
- Nominal and robust train timetabling problems
- Modelling and solving employee timetabling problems
- Recent research directions in automated timetabling
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- An XML format for benchmarks in high school timetabling
- ITC2007 solver description: a hybrid approach
- Adaptive tabu search for course timetabling
- A survey of metaheuristic-based techniques for university timetabling problems
- The third international timetabling competition
- GOAL solver: a hybrid local search based solver for high school timetabling
- Fairness in academic course timetabling
- Setting the research agenda in automated timetabling: the second international timetabling competition
- Automated scheduling and planning. From theory to practice
- Curriculum-based course timetabling with SAT and MaxSAT
- The first international nurse rostering competition 2010
- A survey of school timetabling research
- XHSTT: an XML archive for high school timetabling problems in different countries
- A survey of search methodologies and automated system development for examination timetabling
- Applying evolutionary computation to the school timetabling problem: The Greek case
- Local search and constraint programming for the post enrolment-based course timetabling problem
- Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
- Title not available (Why is that?)
- The late acceptance hill-climbing heuristic
- A step counting hill climbing algorithm applied to university examination timetabling
- Local search and constraint programming for a real-world examination timetabling problem
- Real-life examination timetabling
- Decomposition, reformulation, and diving in university course timetabling
- A column generation approach to high school timetabling modeled as a multicommodity flow problem
- A column generation approach for solving the examination-timetabling problem
- Integer programming methods for large-scale practical classroom assignment problems
- Integer programming techniques for educational timetabling
- Constraint programming for high school timetabling: a scheduling-based model with hot starts
- Generating applicable synthetic instances for branch problems
- A new lower bound for curriculum-based course timetabling
- Integer programming for the generalized high school timetabling problem
- An overview of curriculum-based course timetabling
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
- Integrating matheuristics and metaheuristics for timetabling
- Title not available (Why is that?)
- maxSAT-based large neighborhood search for high school timetabling
- A cellular memetic algorithm for the examination timetabling problem
- The second international nurse rostering competition
- Penalising Patterns in Timetables: Novel Integer Programming Formulations
- A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem
- Random partial neighborhood search for the post-enrollment course timetabling problem
- Improved local search approaches to solve the post enrolment course timetabling problem
- Scheduling EURO-k conferences
- Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- An Adaptive Flex-Deluge Approach to University Exam Timetabling
- Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems
- Feature-based tuning of single-stage simulated annealing for examination timetabling
- An effective hybrid local search approach for the post enrolment course timetabling problem
- A decomposition-based heuristic procedure for the medical student scheduling problem
- Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
Cited In (5)
- Practices in timetabling in higher education institutions: a systematic review
- The exam location problem: mathematical formulations and variants
- A multi-objective mixed integer linear programming model for thesis defence scheduling
- An XML format for benchmarks in high school timetabling
- Strong bounds with cut and column generation for class-teacher timetabling
This page was built for publication: Educational timetabling: problems, benchmarks, and state-of-the-art results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167390)
