Class Assignment Problem Considering Time Relationships

The class assignment problem concerns determining student class assignments based on quotas. This problem is also applied in universities to determine student lab assignments as well as in a wide variety of other applications. Hence, the class assignment problem falls into the category of decision-making problems such as those of the efficient operation of university systems. Moreover, it can also be defined as an optimization problem closely related to informatics and computer science. In this study, we formulate a class assignment problem in which the days of the week and the time are set in the same way as a general timetable. In addition, the problem was evaluated by solving an example case. In particular, the objective function was determined by incorporating the continuity of the timetable. The findings of this work contribute to research on institutional administration in universities as well as to general computer science.