Constraint-Based University Timetabling for the German University in Cairo
نویسندگان
چکیده
The course timetabling problem at the German University in Cairo has been in existence ever since the establishment of the university in 2003. Courses offered at the university, academic staff resources, and room resources make the problem over-constrained. Currently timetables are manually designed. The process is effort and time consuming and the results are often not satisfactory. In this paper, we provide a description of the problem and we show how it can be modeled as a constraint satisfaction problem. Our system, implemented in SICStus Prolog, generates a good timetable within some minutes instead of by hand some weeks.
منابع مشابه
Using fuzzy c-means clustering algorithm for common lecturer timetabling among departments
University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...
متن کاملSolving the Course-timetabling Problem of Cairo University Using Max-SAT
Due to the good performance of current SAT (satisfiability) and MaxSAT (maximum satisfiability) solvers, many real-life optimization problems such as scheduling can be solved by encoding them into Max-SAT. In this paper we tackle the course timetabling problem of the department of mathematics, Cairo University by encoding it into Max-SAT. Generating timetables for the department by hand has pro...
متن کاملDistributed University Timetabling with Multiply Sectioned Constraint Networks
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed timetabling problems (DisTTPs) was studied as distributed constraint satisfaction problems (DisCSPs). We present an alternative method for solving DisTTPs based on multiply sectioned constraint networks (MSCNs). The pro...
متن کاملUniversity Timetabling in ECLPS
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.
متن کاملSystem Demonstration of Interactive Course Timetabling
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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007