University timetabling problems can be classified into two main categories: course and examination timetabling. We discuss the problem statements and constraints for each of them and provide an overview of some recent research advances that have been made by the authors and members of their research team. We particularly concentrate upon: • Meta-heuristic approaches that are less dependent upon...

This paper investigates a tabu search based hyper-heuristic for solving examination timetabling problems. The hyper-heuristic framework uses a tabu list to monitor the performance of a collection of low-level heuristics and then make tabu heuristics that have been applied too many times, thus allowing other heuristics to be applied. Experiments carried out on examination timetabling datasets fr...

Following the success of the First International Timetabling Competition in 2002, the timetabling research community is organising a new competition on this problem (opening July 22nd). This new competition will be on three different timetabling problems, and one of the tracks concerns the course timetabling formulation that applies to Italian universities (called Curriculum-based Course Timeta...

In examination timetabling we have to assign the exams of a given set of courses to time slots, such that conflicting exams are assigned to different time slots. We study the problem that occurs at our department. The characteristics of this problem are as follows. The exams have to take place in 5 days, and per day there are 2 time slots. Teachers can express their preferences for the time slo...

Following the success of the First International Timetabling Competition in 2002, the timetabling research community is organising a new competition on this problem (opening August 1st). This new competition will be on three different timetabling problems, and one of the tracks concerns the course timetabling formulation that applies to Italian universities (called Curriculum-based Course Timet...

The general timetabling problem is an assignment of activ ities to xed time intervals adhering to a prede ned set of resource availabilities Timetabling problems are di cult to solve and can be ex tremely time consuming without some computer assistance In this paper the application of constraint based reasoning to timetable generation is examined Speci cally we consider how a timetabling proble...

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 casebased reasoning (CBR) system to match a new problem with one from a case-base of previously solved problems. The case base will also store the heuristic or meta-heuristic technique(s) applied most...

General Optimization Methods Mathematical Programming, Constraint Programming, Heuristics Problem Specific Algorithms (Dynamic Programming, Branch and Bound) Scheduling Single and Parallel Machine Models Flow Shops and Flexible Flow Shops Job Shops Resource-Constrained Project Scheduling Timetabling Interval Scheduling, Reservations Educational Timetabling Workforce and Employee Timetabling Tra...

Examination timetabling is problem faced by many academic educational institutions. The situation formulated as artificial intelligence problems Sudoku grid with Magic square. Problem assigning a set of examinations to fixed number examination periods so that no student required take more than one at time. research describes two proposed heuristic algorithms create university and avoiding the o...