Skip to main content

Research Repository

Advanced Search

Analysing similarity in exam timetabling

Burke, Edmund; Eckersley, Adam; McCollum, Barry; Petrovic, Sanja; Qu, Rong

Analysing similarity in exam timetabling Thumbnail


Authors

Edmund Burke

Adam Eckersley

Barry McCollum

SANJA PETROVIC SANJA.PETROVIC@NOTTINGHAM.AC.UK
Professor of Operational Research

Profile image of RONG QU

RONG QU rong.qu@nottingham.ac.uk
Professor of Computer Science



Abstract

In this paper we carry out an investigation of some of the major features of exam timetabling problems with a view to developing a similarity measure. This similarity measure will be used within a case-based reasoning (CBR) system to match a new problem with one from a case-based of previously solved problems. The case base will also store the heuristic for meta-heuristic techniques applied most successfully to each problem stored. The technique(s) stored with the matched case will be retrieved and applied to the new case. The CBR assumption in our system is that similar problems can be solved equally well by the same technique.

Citation

Burke, E., Eckersley, A., McCollum, B., Petrovic, S., & Qu, R. (2004). Analysing similarity in exam timetabling.

Conference Name International Conference on the Practice and Theory of Automated Timetabling 2004
Start Date Aug 18, 2004
End Date Aug 20, 2004
Publication Date Jan 1, 2004
Deposit Date Dec 12, 2005
Publicly Available Date Oct 9, 2007
Public URL https://nottingham-repository.worktribe.com/output/1021269
Contract Date Dec 12, 2005

Files





You might also like



Downloadable Citations