This system demonstration presents an approach to interactive timetabling used by the UniTime university timetabling system. This application, which is publicly available under an open source license, has been successfully applied at Purdue University [8], a large public university (39,000 students) with a broad spectrum of programs at the undergraduate and graduate levels. The complete system ...

The Course Timetabling Problem consists of the weekly scheduling of lectures of a collection of university courses, subject to certain constraints. The International Timetabling Competitions, ITC-2002 and ITC-2007, have been organized with the aim of creating a common formulation for comparison of solution proposals. This paper discusses the design and implementation of an extendable family of ...

This work arises from the research of the Metaheuristics Network on the University Course Timetabling Problem. In a first phase straightforward implementations of different metaheuristics were compared on a common local search framework [4]. In a second phase problem specific knoweldge was exploited and several alternatives for local search and metaheuristics were considered. Many possibilities...

We consider the problem of creating fair course timetables in the setting of a university. Our motivation is to improve the overall satisfaction of individuals concerned (students, teachers, etc.) by providing a fair timetable to them. The central idea is that undesirable arrangements in the course timetable, i. e., violations of soft constraints, should be distributed in a fair way among the i...

The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a number of different versions of the timetabling problem. These include school timetabling (where students are grouped in classes with similar degree plans), university timetabling (where students are considered individu...

The process of gathering enough experimental statistical data over a set of instances of the Course timetabling problem (CTTP) could take a lot of time to an interested researcher. There exist several parallel computing models capable to accelerating the execution process of metaheuristic algorithms. This paper explores the idea to use a parallel model in a metaheuristic algorithm over the Cour...