Timetabling problems are often solved based upon what is assumed to be complete information about the problem. However, users may later desire modifications to the generated timetable to adapt to changing requirements or increase their personal satisfaction with the solution [1,5,3]. Methods that allow corrections to an existing timetable while leaving most of the solution intact are necessary....

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 ...

Operations research is a well-established field that uses computational systems to support decisions in business and public life. Good solutions to operations research problems can make a large difference to the efficient running of businesses and organisations and so the field often searches for new methods to improve these solutions. The high school timetabling problem is an example of an ope...

This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Within the hyperheuristic framework, a Tabu Search approach is employed to search for permutations of graph heuristics which are used for constructing timetables in exam and course timetabling problems. This underpins a m...

We describe the use of very large-scale neighborhood search (VLSN) techniques in examination timetabling problems. We detail three applications of VLSN algorithms that illustrate the versatility and potential of such algorithms in timetabling. The first of these uses cyclic exchange neighborhoods, in which an ordered subset of exams in disjoint time slots are swapped cyclically such that each e...

Curriculum-based course timetabling deals with the weekly assignment of a set of lectures for university courses to specific timeslots and rooms, where conflicts between courses are set according to curricula published by the university and not on the basis of enrolment data. The curriculum-based course timetabling is considered as the third track in the 2 International timetabling competition ...

Employee Timetabling Problems (ETP) are all around us. One possible approach for solving ETPs is to use constraint processing techniques. Another approach that has been used many times in the past is to model human knowledge into knowledge-based systems for timetabling. It is diicult to represent the complex constraints of timetabling explicitly in constraint networks. On the other hand, knowle...