Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
From MaRDI portal
Publication:2668751
Recommendations
- Quality recovering of university timetables
- Robust university course timetabling problem subject to single and multiple disruptions
- Integer programming for minimal perturbation problems in university course timetabling
- A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem
- Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
Cites work
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem
- A robust simulated annealing based examination timetabling system.
- A supernodal formulation of vertex colouring with applications in course timetabling
- A survey of metaheuristic-based techniques for university timetabling problems
- A survey of school timetabling research
- A survey on metaheuristics for stochastic combinatorial optimization
- An overview of curriculum-based course timetabling
- Automated scheduling and planning. From theory to practice
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Comments on: ``An overview of curriculum-based course timetabling
- Constraint solving in uncertain and dynamic environments: A survey
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
- scientific article; zbMATH DE number 1373656 (Why is no real title available?)
- Hybrid search for minimal perturbation in dynamic CSPs
- Hybrid variable neighbourhood approaches to university exam timetabling
- Integer programming for minimal perturbation problems in university course timetabling
- Optimization by simulated annealing
- Penalising patterns in timetables: novel integer programming formulations
- Probe backtrack search for minimal perturbation in dynamic scheduling
- Quality recovering of university timetables
- Revisiting simulated annealing: a component-based analysis
- Robust university course timetabling problem subject to single and multiple disruptions
- The sample average approximation method for stochastic discrete optimization
Cited in
(3)
This page was built for publication: Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668751)
