Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

This paper summarizes the work done to solve a complex course timetabling problem at a
large university and provides new insights into the overall timetabling process. The first step …

In this paper we present a general integer programming-based approach for the minimal
perturbation problem in university course timetabling. This problem arises when an existing …

The modeling and solution approaches being used to automate construction of course
timetables at a large university are discussed. A course structure model is presented that …

We address the problem of evolutionary system design (ESD) by means of answer set
programming modulo difference constraints (AMT). The goal of this design approach is to …

Abstract Answer Set Programming (ASP) is an approach to declarative problem solving,
combining a rich yet simple modeling language with high performance solving capacities …

Many real-life problems are dynamic, with changes in the problem definition occurring after
a solution to the initial formulation has been reached. A minimal perturbation problem …

This work concentrates on the design of a system intended for study of advanced scheduling
techniques for planning various types of jobs in a Grid environment. The solution is able to …

At universities, the timetable plays a large role in the daily life of students and staff, showing
when and where lectures are given. But whenever a schedule is executed in a dynamic …

In this paper, we address a driver–vehicle scheduling problem in a limousine rental
company. Given a set of trips to be covered, the goal consists in finding a driver–vehicle …