Course timetabling is a multi-dimensional NP-Complete problem that has generated
hundreds of papers and thousands of students have attempted to solve it for their own …

The timetabling problem consists in scheduling a sequence of lectures between teachers
and students in a prefixed period of time (typically a week), satisfying a set of constraints of …

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 …

This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a
problem of curriculum-based course timetabling. The proposed algorithm follows a general …

Although there has been a fair amount of research in the area of school timetabling, this
domain has not developed as well as other fields of educational timetabling such as …

Examination timetabling is a well-studied combinatorial optimization problem. We present a
new hybrid algorithm for examination timetabling, consisting of three phases: a constraint …

Many combinatorial problems, including a variety of combinatorial optimization problems,
can be naturally formulated as a constraint satisfaction problem (CSP). We develop in this …

Although there has been a fair amount of research in the area of school timetabling, this
domain has not grown as well as other fields of educational timetabling such as university …

The typical course timetabling problem is assigning Classes of students to appropriate
faculty members, suitable classrooms and available timeslots. Hence, it involves a large …

The majority of existing algorithms for learning decision trees are greedy—a tree is induced
topdown, making locally optimal decisions at each node. In most cases, however, the …