A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
From MaRDI portal
Publication:1761907
DOI10.1007/s10479-010-0696-zzbMath1251.90164OpenAlexW1975092176MaRDI QIDQ1761907
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://orca.cf.ac.uk/11332/1/Lewis%2C_R_TimeDependent.pdf
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
Effective learning hyper-heuristics for the course timetabling problem ⋮ Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem ⋮ Random partial neighborhood search for the post-enrollment course timetabling problem ⋮ An ILP based heuristic for a generalization of the post-enrollment course timetabling problem ⋮ A matheuristic for customized multi-level multi-criteria university timetabling ⋮ A methodology for determining an effective subset of heuristics in selection hyper-heuristics ⋮ A time-dependent metaheuristic algorithm for post enrolment-based course timetabling ⋮ On the performance of scatter search for post-enrolment course timetabling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A robust simulated annealing based examination timetabling system.
- A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
- Solving the post enrolment course timetabling problem by ant colony optimization
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- Metaheuristics for University Course Timetabling
- New methods to color the vertices of a graph
This page was built for publication: A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
