The study of differences between timetabling research presented in conferences like PATAT
or published in Annals of OR and commercial timetabling software used in Higher Education …

Abstract In 2007, the Second International Timetabling Competition (ITC-2007) has been
organized and a formal definition of the Curriculum-Based Course Timetabling (CB-CTT) …

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 …

One of the main challenges for university administration is building a timetable for course
sessions. This is not just about building a timetable that works, but building one that is as …

Following the success of the First International Timetabling Competition in 2002, the
timetabling research community is organising a new competition on this problem (opening …

In this paper, we investigate variable neighbourhood search (VNS) approaches for the
university examination timetabling problem. In addition to a basic VNS method, we introduce …

Hyper-heuristics can be identified as methodologies that search the space generated by a
finite set of low level heuristics for solving search problems. An iterative hyper-heuristic …

The university course timetabling problem (UCTP) is a combinatorial optimization problem,
in which a set of events has to be scheduled into time slots and located into suitable rooms …

University course timetabling problem (UCTP) is considered to be a hard combinatorial
optimization problem to assign a set of events to a set of rooms and timeslots. Although …

Combinations of evolutionary based approaches with local search have provided very good
results for a variety of scheduling problems. This paper describes the development of such …