A stochastic local search algorithm with adaptive acceptance for high-school timetabling
From MaRDI portal
Publication:284406
DOI10.1007/s10479-014-1660-0zbMath1336.90075OpenAlexW1964734388WikidataQ57922028 ScholiaQ57922028MaRDI QIDQ284406
Ender Özcan, Ahmed Kheiri, Andrew J. Parkes
Publication date: 18 May 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://orca.cf.ac.uk/85713/1/ITC2011.pdf
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A review of hyper-heuristics for educational timetabling ⋮ Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery ⋮ Recent advances in selection hyper-heuristics ⋮ A comparative study of modern heuristics on the school timetabling problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A review of hyper-heuristics for educational timetabling
- The third international timetabling competition
- Optimal speedup of Las Vegas algorithms
- School timetabling for quality student and teacher schedules
- A general heuristic for vehicle routing problems
- Applying evolutionary computation to the school timetabling problem: The Greek case
- A GRASP strategy for a more constrained school timetabling problem
- Finding a feasible course schedule using Tabu search
- The combinatorics of timetabling
- Applied simulated annealing
- Constraint programming approach for school timetabling.
- An XML format for benchmarks in high school timetabling
- Towards constraint-based school timetabling
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- On the Complexity of Timetable and Multicommodity Flow Problems
- Final examination scheduling
- Evolutionary Computation in Combinatorial Optimization
