This paper describes how the university timetabling problem is addressed in the Laurea course Ingegneria dell’Informazione (Information Engineering) for the University of Ferrara, Italy. The university timetabling problem is modelled as a Constraint Optimisation Problem and addressed with ECLPS, one of the leading Constraint Logic Programming languages.

In this paper we outline recent research into the complex and difficult task of university course timetabling, which involves both subjective and objective information and expert judgement. We go on describe the development and use of a decision support system, called SlotManager, for assigning courses to timeslots and rooms within a New Zealand university. SlotManager is designed to augment th...

Optimization problems, such as resource allocation or scheduling, often involves different entities, such as departments or production units, which might have different constraints and objectives, but are interested in cooperating. In this presentation, we survey various scenarios and the solutions proposed in the literature for this kind of situations. We start from simple distributed constrai...

Scheduling is one the problems on which so many researches have been done over years and university course timetabling problem which is a NP-hard problem is a type of scheduling problem. On the other hand, timetabling process must be done for each semester frequently which is an exhausting and time consuming task. University course timetabling problem performs the allocation of whole events to ...

One of the main challenges for any university administrations is building a timetable for course sessions. Such a challenge not only relates to how to build a usable timetable but also how to build an optimal timetable at the same time. The university course timetable is classified as an NP-Complete problem. In general, it means assigning predefined courses to certain rooms and timeslots under ...

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...

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...

Timetabling is a typical application of constraint programming whose task is to allocate activities to slots in available resources respecting various constraints like precedence and capacity. In this paper we present a basic concept, a constraint model, and a solution algorithm for interactive timetabling. Interactive timetabling combines automated timetabling (the computer allocates the activ...

It is proposed a binary integer programming model to handle a real instance of the courses-to-professors timetabling problem. The optimization criterion is the preferences of professors by courses and schedules. Besides the common set of constraints, specific features of this situation are considered. To decide about different optimal solutions, it is introduced a coefficient to measure (altern...