A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
From MaRDI portal
Publication:3518833
DOI10.1057/palgrave.jors.2602258zbMath1177.90139OpenAlexW2018815957MaRDI QIDQ3518833
Moshe Dror, Samad Ahmadi, Barry McCollum, Edmund Kieran Burke, Salwani Abdullah
Publication date: 12 August 2008
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602258
Related Items (14)
A heuristic method for the vehicle routing problem with mixed deliveries and pickups ⋮ A survey of search methodologies and automated system development for examination timetabling ⋮ Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling ⋮ A multi-objective evolutionary algorithm for examination timetabling ⋮ Operational research in education ⋮ Mathematical models and algorithms for a high school timetabling problem ⋮ An integer programming approach to curriculum-based examination timetabling ⋮ Cyclic transfers in school timetabling ⋮ Constraint-based very large-scale neighborhood search ⋮ Monte Carlo hyper-heuristics for examination timetabling ⋮ Hybrid variable neighbourhood approaches to university exam timetabling ⋮ Decomposition, reformulation, and diving in university course timetabling ⋮ A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems ⋮ A column generation mathematical programming approach for a class-faculty assignment problem with preferences
This page was built for publication: A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
