Scheduling is one of the problems which so many researches have been conducted on it
over the years. The university course timetabling problem which is an NP-hard problem is a …

The Second International Timetabling Competition (TTC2007) opened in August 2007.
Building on the success of the first competition in 2002, this sequel aimed to further develop …

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 …

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) …

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 …

A significant body of recent literature has explored various research directions in hyper-
heuristics (which can be thought as heuristics to choose heuristics). In this paper, we extend …

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 …

In this paper we establish a new algorithm based on genetic algorithms (GA) and sequential
local search to solve course timetabling problem. Universities are challenged to arise in …

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 …