Multiple-retrieval case-based reasoning for course timetabling problems

DOI10.1057/palgrave.jors.2601970zbMath1090.90100OpenAlexW1987980181MaRDI QIDQ5200786

Sanja Petrovic, Rong Qu, Bart L. MacCarthy, Edmund Kieran Burke

Publication date: 11 April 2006

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: http://eprints.nottingham.ac.uk/347/1/rxqJORS.pdf

zbMATH Keywords

simulated annealingtabu searchtimetablingattribute graphcase-based reasoning (CBR)

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (13)

A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems ⋮ A decomposed metaheuristic approach for a real-world university timetabling problem ⋮ Adaptive tabu search for course timetabling ⋮ Operational research in education ⋮ Developing compact course timetables with optimized student flows ⋮ Multiagent cooperative learning strategies for pursuit-evasion games ⋮ Case-based heuristic selection for timetabling problems ⋮ A graph-based hyper-heuristic for educational timetabling problems ⋮ AUTOMATED LECTURE TIMETABLING USING A MEMETIC ALGORITHM ⋮ A university-timetabling problem and its solution using Benders' partitioning---a case study ⋮ Applying the threshold accepting metaheuristic to~curriculum based course timetabling ⋮ Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems ⋮ Polynomial reduction of time-space scheduling to time scheduling

This page was built for publication: Multiple-retrieval case-based reasoning for course timetabling problems