Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
From MaRDI portal
Publication:2668751
DOI10.1016/j.cor.2021.105306OpenAlexW3142912586MaRDI QIDQ2668751
Zeki Kuş, Ayla Gülcü, Can Akkan
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105306
Uses Software
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
- Automated scheduling and planning. From theory to practice
- A survey of school timetabling research
- A supernodal formulation of vertex colouring with applications in course timetabling
- Hybrid search for minimal perturbation in dynamic CSPs
- Quality recovering of university timetables
- Constraint solving in uncertain and dynamic environments: A survey
- Hybrid variable neighbourhood approaches to university exam timetabling
- A survey on metaheuristics for stochastic combinatorial optimization
- A robust simulated annealing based examination timetabling system.
- Probe backtrack search for minimal perturbation in dynamic scheduling
- A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem
- Revisiting simulated annealing: a component-based analysis
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Robust university course timetabling problem subject to single and multiple disruptions
- Comments on: ``An overview of curriculum-based course timetabling
- An overview of curriculum-based course timetabling
- Integer programming for minimal perturbation problems in university course timetabling
- A survey of metaheuristic-based techniques for university timetabling problems
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Penalising Patterns in Timetables: Novel Integer Programming Formulations
This page was built for publication: Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
