Faculty Course Assignment Optimization

Abstract

Course assignment is the way subjects are loaded to faculty members in the university. This study is the first of the three stages of the University Course Timetable Problem. Faculty course assignment optimization optimizes the faculty-subject assignment by applying three models namely linear programming, binary integer programming, and genetic algorithms. Linear programming has the highest rating but it is not feasible because of divisibility rule. Binary integer programming is the best model because its output is higher than genetic algorithms. The binary integer programming model approaches the overall rating of linear programming model for normal scale applications because the binary integer programming model has more choices of possible combination of assignment under difficult than in simple problems. For as long as formulation of the needed function and constraints is possible and the solver can process them, then the binary integer programming model can provide the feasible and optimal solution. Genetic algorithms are capable of giving feasible solutions even in very complicated scheduling conditions. The linear programming model can be used as a basis of the correctness of the output because the optimum value that it gives is higher than those of the two models.