Timetabling problems are well known NP-hard constraint satisfaction, and real-world cases often have complicated and challenging structures. For such problems, we present a new hybrid method, “Interleaved Constructive Memetic Algorithm” (ICMA) that interleaves memetic algorithms with constructive methods. ICMA works using an active subset of all the events. Starting with a few events, in multip...

The International Timetabling Competition 2019 (ITC 2019) posed a university timetabling problem involving assigning classes to times and rooms for an entire semester while students required classes. We propose new mixed integer programming (MIP) formulation of the problem. MIP takes advantage different graph structures in conflict graphs construct strong constraints. In addition, we introduce ...

A timetable is a temporal arrangement of a set of meetings such that all given constraints are satis-ed. A timetabling problem can be suitably modelled in terms of a set of constraints. We use constraint logic programming and develop methods, techniques and concepts for a combined interactive and automatic timetabling of university courses and school curricula. An exemplary application of such ...

The “Academic Timetabling System” is a research project that has been funded by the deanship of scientific research of Tabuk University. The project aims at developing and implementing an academic time tabling system for Tabuk University that is based on MultiAgent technology. In this paper we introduce the “Academic Time Tabling System” that has been designed and implemented in Tabuk Universit...

The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairly spreading the exams for the students, and satisfying room capacity constraints. We present a family of solution algorithms for a set of variants of the Examination Timetabling problem. The algorithms are based on tabu search...

E-mail : fabdennad,[email protected] Abstract : Timetabling the courses offered at the Computer Science Department of the University of Munich requires the processing of hard and soft constraints. Hard constraints are conditions that must be satisfied, soft constraints however may be violated, but should be satisfied as much as possible. This paper shows how to model our timetab...