Constraints for the Computer Science Major Curriculum Optimization Problem

Abstract

this study presents a set of constraints used in the curriculum optimization problem of computer science majors. A simulation model of an optimal curriculum can have different objective functions as required by the user. The constraints filter out a set of acceptable values so that the filtered values can be used even without solving for the objective function. In addition to basic constraints such as the number of semesters and credit hours for each course, the system also includes constraints that govern the sequence of related courses. We interviewed experts and used the pairwise comparison approach to identify the groups of related courses and to assign them to semesters. We used a new method for processing pairwise comparison matrices. We also intoriduce the course sequence factor that can be converted into the specific number of the semester