A multi-objective evolutionary algorithm for examination timetabling
From MaRDI portal
Publication:842554
DOI10.1007/s10951-008-0085-5zbMath1179.90133OpenAlexW2063076812MaRDI QIDQ842554
Chun Yew Cheong, Bharadwaj Veeravalli, Kay Chen Tan
Publication date: 25 September 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-008-0085-5
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem, A cellular memetic algorithm for the examination timetabling problem, An integer programming approach to curriculum-based examination timetabling, An Adaptive Flex-Deluge Approach to University Exam Timetabling, Robust university course timetabling problem subject to single and multiple disruptions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving examination timetabling problems through adaption of heuristic orderings
- An introduction to timetabling
- A survey of search methodologies and automated system development for examination timetabling
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
- Case-based heuristic selection for timetabling problems
- Hybrid variable neighbourhood approaches to university exam timetabling
- Scheduling examinations to reduce second-order conflicts
- Variable neighborhood search
- A robust simulated annealing based examination timetabling system.
- Using tabu search with longer-term memory and relaxation to create examination timetables.
- Recent research directions in automated timetabling
- Hybrid heuristics for examination timetabling problem
- Constraint satisfaction problems: Algorithms and applications
- Comparison of metaheuristic algorithms for examination timetabling problem
- Variants of simulated annealing for the examination timetabling problem
- A graph-based hyper-heuristic for educational timetabling problems
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
- A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
- New methods to color the vertices of a graph
- Extended clique initialisation in examination timetabling
- Ant colony optimization for the examination scheduling problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A system for computing university examination timetables
- Final examination scheduling
- Variable neighborhood search: Principles and applications
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
