Özet:

Academic timing problems fall into the class of optimization problems called NP-Zor that are unresolved in polinom time. In the orientation research literature, these problems are studied under two main titles: record-based timing and program-based timing. In this study, the course-based academic time planning process was analyzed after the studies carried out in the field of the programme-based academic time planning was thoroughly discussed. The problem addressed is not a simple assignment problem, as in many other studies, and it contains many limitations to the classes (student groups) in which the classes belong. According to the titles of teachers, a full number of linear models were proposed for this problem where their satisfaction from the curriculum was tried to be reduced and the results were evaluated by solving the model proposed for a small-dimensional sample.

Anahtar Kelimeler: