Graph colouring is one of those rare examples in the mathematical sciences of a problem that, while easy to state and visualise, has many aspects that are exceptionally difficult to …
Examination timetabling is one of the most important administrative activities that takes place in all academic institutions. In this paper, we present a critical discussion of the research on …
As well as nearly always belonging to the class of NP-complete problems, university timetabling problems can be further complicated by the often idiosyncratic requirements …
B McCollum - International conference on the practice and theory of …, 2006 - Springer
The study of the relationship and interaction between the work carried out in the academic literature and the requirements of university administrators is essential if ideas generated by …
G Kendall, NM Hussin - International Conference on the Practice and …, 2004 - Springer
In this paper we introduce an examination timetabling problem from the MARA University of Technology (UiTM). UiTM is the largest university in Malaysia. It has 13 branch campuses …
In this paper, we address the issue of ordering exams by simultaneously considering two separate heuristics using fuzzy methods. Combinations of two of the following three heuristic …
B McCollum, N Ireland - E Burke, HR, ed.: PATAT, 2006 - Citeseer
As an academic in the School of Computer Science at Queen's University, a visiting researcher to the Automated Scheduling, Opimisation and Planning (ASAP) group within the …
Since the 1960s, automated approaches to examination timetabling have been explored and a wide variety of approaches have been investigated and developed. In this paper we …
E Ozcan, Y Bykov, M Birben… - 2009 IEEE Congress on …, 2009 - ieeexplore.ieee.org
A hyperheuristic is a high level problem solving methodology that performs a search over the space generated by a set of low level heuristics. One of the hyperheuristic frameworks is …