Results 1  10
of
15
University course timetabling using constraint handling rules
 Journal of Applied Artificial Intelligence
"... 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 p ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
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 timetabling problem as a partial constraint satisfaction problem and gives a concise finite domain solver implemented with Constraint Handling Rules that, by performing soft constraint propagation, allows for making soft constraints an active part of the problem solving process. Furthermore, we improve efficiency by reusing parts of the timetable of the previous year. Our prototype needs only a few minutes to create a timetable while manual timetabling usually takes a few days. It was presented at the Systems’98 computer fair in Munich and several universities have enquired for it. 1
Interactive Timetabling: Concepts, Techniques, and Practical Results
 PATAT 2002 — Proceedings of the 4th international conference on the Practice And Theory of Automated Timetabling
, 2002
"... Abstract. 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 intera ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
(Show Context)
Abstract. 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 activities) with user interaction (the user can interfere with the process of timetabling). Because the user can see how the timetabling proceeds and he or she can intervene this process, we believe that such approach is more convenient than full automated timetabling, which behaves like a blackbox. We also present some results achieved when applying our techniques to solving a reallife timetabling problem at the Faculty of Mathematics and Physics at Charles University.
University Timetabling using Constraint Logic Programming
 PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES
, 1999
"... A timetable is a temporal arrangement of a set of meetings such that all given constraints are satisfied. 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 combination of interactive ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
(Show Context)
A timetable is a temporal arrangement of a set of meetings such that all given constraints are satisfied. 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 combination of interactive and automatic timetabling of university courses and school curricula. An exemplary application of such a timetabling system was developed for the Charit'e Medical Faculty at the Humboldt University, Berlin. The timetabling system is flexible enough to take into account special user requirements and to allow constraints to be modified easily if no basic conceptual change in the timetabling is necessary. An essential component is an automatic heuristic solution search with an interactive userintervention facility. The user will, however, only be able to alter a timetable or schedule such that no hard constraints are violated.
Constraint Handling Rules: Applications and Extensions
 Extensions and Applications of ConstraintLogic Programming and 7th International Workshop on Deductive Databases and Logic Programming
, 1999
"... this paper we present a finite domain solver written in CHR, which performs hard and soft constraint propagation. Hard constraints are conditions that must be satisfied, soft constraints, however, may be violated, but should be satisfied as much as possible. The solver is powerful enough to serve as ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
this paper we present a finite domain solver written in CHR, which performs hard and soft constraint propagation. Hard constraints are conditions that must be satisfied, soft constraints, however, may be violated, but should be satisfied as much as possible. The solver is powerful enough to serve as the core of a university timetabling system. Then we show that a small and simple extension to CHR makes it a generalpurpose constraint logic programming language. The extended language, called "CHR
Constraintbased Timetabling with Student Schedules
, 2000
"... . One of the peculiarities of university timetabling problems lies in their huge complexity and the easy transition between complex constrained system and an overconstrained one. The Faculty of Informatics timetabling problem represents very complex scheduling and resource allocation problem as ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
. One of the peculiarities of university timetabling problems lies in their huge complexity and the easy transition between complex constrained system and an overconstrained one. The Faculty of Informatics timetabling problem represents very complex scheduling and resource allocation problem as individual timetable for every student has to be scheduled with respect to heterogeneous choices of the students for their courses. The problem is solved via constraint programming approach, with variables' annotations for computing variable ordering and with special objective function aimed to minimize students' conicts, both helping to solve overconstrained part of the problem as well as to control exploration of the search space. 1 Introduction Faculty of Informatics timetabling problem represents large scale highly constrained scheduling problem as individual timetable for every student from more than thousand students has to be scheduled wrt. course preenrollment information...
On Methods of ConstraintBased Timetabling
 PROCEEDINGS PACLP’00
, 2000
"... Using Constraint Logic Programming, we develop methods, techniques and concepts for combined interactive and automatic timetabling. An exemples application of our timetabling system proved successful, thus demonstrating the suitability of the methods used. This paper focuses on methods for genera ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Using Constraint Logic Programming, we develop methods, techniques and concepts for combined interactive and automatic timetabling. An exemples application of our timetabling system proved successful, thus demonstrating the suitability of the methods used. This paper focuses on methods for generating timetables for practical courses. This is a subproblem of our application and can be considered independently of the rest of the problem. The representation of the important constraints is described. Different methods concerning redundant constraints and heuristics for solution search are discussed and computation results are given.
Classroom Assignment using Constraint Logic Programming
, 2000
"... The Classroom Assignment problem consists of scheduling a set of courses into a fixed number of rooms, given a fixed timetable. At the University of Munich, a classroom plan has to be created each semester after collecting timetables of all departments and wishes of teachers. This planning is ver ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The Classroom Assignment problem consists of scheduling a set of courses into a fixed number of rooms, given a fixed timetable. At the University of Munich, a classroom plan has to be created each semester after collecting timetables of all departments and wishes of teachers. This planning is very complex since a lot of constraints have to be met, e.g. room size and equipment. Using constraintbased programming, we developed a prototype, called RoomPlan, that supports automatic creation of classroom plans. With RoomPlan a schedule can be created interactively within some minutes instead of some days. RoomPlan was presented at the Systems'99 Computer exhibition in Munich.
A twophase heuristic evolutionary algorithm for personalizing course timetables: a case study in a Spanish university
, 2005
"... ..."