Variants of simulated annealing for the examination timetabling problem
From MaRDI portal
Publication:1919836
DOI10.1007/BF02601641zbMath0851.90069OpenAlexW1983052335MaRDI QIDQ1919836
Jonathan M. Thompson, Kathryn A. Dowsland
Publication date: 18 September 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02601641
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
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 ⋮ A step counting hill climbing algorithm applied to university examination timetabling ⋮ Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling ⋮ Feature-based tuning of single-stage simulated annealing for examination timetabling ⋮ An effective hybrid local search approach for the post enrolment course timetabling problem ⋮ Metaheuristics: A bibliography ⋮ Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling ⋮ An integer programming approach to curriculum-based examination timetabling ⋮ An Adaptive Flex-Deluge Approach to University Exam Timetabling ⋮ A robust simulated annealing based examination timetabling system. ⋮ A constructive approach to examination timetabling based on adaptive decomposition and ordering ⋮ Adaptive selection of heuristics for improving exam timetables ⋮ Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure ⋮ Solving the multi-objective nurse scheduling problem with a weighted cost function ⋮ Improved local search approaches to solve the post enrolment course timetabling problem ⋮ Adaptive linear combination of heuristic orderings in constructing examination timetables ⋮ 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 ⋮ 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 ⋮ Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy ⋮ Nurse scheduling with tabu search and strategic oscillation
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
