Setting up a university timetable is a complex, combinatorial process that requires a lot of work, appropriate domain and organizational knowledge, and access to university data. In the literature, this problem is the subject of numerous studies and is classified as a University Course Timetabling Problem (UCTP). When arranging the timetable, it is necessary to make many assignments such as: student groups for courses, lecturers for courses, courses for time slots and lecture halls, etc. At the same time, many resource, time, and order conflicts must be resolved, while many constraints must be met, including logical constraints. Logical constraints result, among others, from the preferences of students, lecturers, local conditions, etc. It is also extremely important to use a proactive approach when constructing the plan, which works well in unusual and unexpected situations, such as the unavailability of lecturers, lecture halls, etc. Based on the experience of practitioners, literature models and methods, an original two-stage approach based on UCTP decomposition is proposed. The paper also presents the implementation and results of computational experiments of the proposed approach.