System of automated timetabling

A construction of timetabling is considered to be a computationally hard problem. The problem lies not only in NP-completeness, but also in a number of complicated interactions between different users. We present a system of automated timetabling (SAT), as a proposition for a global look at timetabling. It describes four tools for managing timetable. The constraint programming (CP) techniques were used for solving the problem. CP provides both declarativity and flexibility. Moreover it allows easily add a new constraint and model numerous specific constraints that are often encountered in such problems. Additional local search was incorporated into CP to allow effectively optimise timetable.