Variants of simulated annealing for the examination timetabling problem
From MaRDI portal
Publication:1919836
DOI10.1007/BF02601641zbMath0851.90069MaRDI QIDQ1919836
Kathryn A. Dowsland, Jonathan M. Thompson
Publication date: 18 September 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
simulated annealing; graph theory; multi-objective optimisation; multi-objective examination timetabling
90C35: Programming involving graphs or networks
90C29: Multi-objective and goal programming
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
Related Items
A survey of search methodologies and automated system development for examination timetabling, A grasp-knapsack hybrid for a nurse-scheduling problem, A multi-objective evolutionary algorithm for examination timetabling, Hybrid variable neighbourhood approaches to university exam timetabling, A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing, A robust simulated annealing based examination timetabling system., Nurse scheduling with tabu search and strategic oscillation, Towards a reference model for timetabling and rostering, An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem, Managing the tabu list length using a fuzzy inference system: an application to examination timetabling, Metaheuristics: A bibliography, Solving the multi-objective nurse scheduling problem with a weighted cost function
Uses Software
Cites Work
- Some experiments with simulated annealing for coloring graphs
- Tabu search for large scale timetabling problems
- Scheduling examinations to reduce second-order conflicts
- Some experiments with simulated annealing techniques for packing problems
- EPCOT: An efficient procedure for coloring optimally with Tabu Search
- Combinatorial Optimization Problems with Soft and Hard Requirements
- Final examination scheduling
