University course timetabling problem

In this study entitled ?University Course Timetabling Problem? (UCTP), UCTP which is a particular type of AP, is investigated. Firstly, AP is discussed and Hungarian Method, which is a well-known solution method for AP, is explained with a numerical example. Then, Timetabling problem is presented with its different types and its solution methods. One of these different types is Educational Timetabling Problem divided into two headings called School Timetabling and University Timetabling. Also, University Timetabling is presented with two headings: University Exam Timetabling and University Course Timetabling.UCTP deals with the allocation of faculty members to courses, the scheduling of courses during the week as well as the assignment of courses to classrooms.In the study, a binary integer programming model is constructed for UCTP that occurs in the department of mathematics in a domestic university. The model contains hard constraints and a soft constraint. The model includes all of the uniqueness, completeness, consecutiveness, laboratory, pre-assignment, type of variable constraints and some of the daily-course load and session constraints which are known as hard constraints; as well as soft constraints among which are non-conflict constraints preventing the conflict of course times belonging to different student groups, the session constraint providing one day off between same lesson for same student group and the daily-lesson load constraint providing at least two lessons per day for every single student group. The operation of the model is illustrated with the data sets provided from the previous term of the relevant department. The maximization objective function provides that the assignments will enhance the satisfaction level of education and they will be in line with the desire of the Department/Faculty members.Key words: Assignment problem, education timetabling, university course timetabling, integer programming.