Constraint-Based Timetabling System for the German University in Cairo

Authors:
Slim Abdennadher;Mohamed Aly;Marlien Edward
Affiliations:
Department of Computer Science, German University in Cairo, Cairo, Egypt;Department of Computer Science, German University in Cairo, Cairo, Egypt;Department of Computer Science, German University in Cairo, Cairo, Egypt
Venue:
Applications of Declarative Programming and Knowledge Management
Year:
2009

Citing 4
Cited 1

A Comparative Study of Eight Constraint Programming LanguagesOver the Boolean and Finite Domains

Constraints
Essentials of Constraint Programming

Essentials of Constraint Programming
Essentials of Constraint Programming

Essentials of Constraint Programming
Ant algorithms for the exam timetabling problem

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI

Evolutionary algorithms using cluster patterns for timetabling

Intelligent Decision Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constraint programming is mainly used to solve combinatorial problems such as scheduling and allocation, which are of vital importance to modern business. In this paper, we introduce the course and examination timetabling problems at the German University in Cairo. As manual generation of schedules is time-consuming and inconvenient, we show how these problems can be modeled as constraint satisfaction problems and can be solved using SICStus Prolog with its powerful constraint library.