Analysing Similarity in Exam Timetabling

Burke, Edmund and Eckersley, Adam and McCollum, Barry and Petrovic, Sanja and Qu, Rong (2004) Analysing Similarity in Exam Timetabling. In: International Conference on the Practice and Theory of Automated Timetabling 2004, Aug 2004, Pittsburg, US.

This is the latest version of this item.

[img] PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (169kB)

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.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: exam timetabling
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Depositing User: Qu, Rong
Date Deposited: 28 Feb 2007
Last Modified: 09 Oct 2007 15:52
URI: http://eprints.nottingham.ac.uk/id/eprint/368

Available Versions of this Item

Actions (Archive Staff Only)

Edit View Edit View