Teaching Assignment Problem Solver

In this paper, we describe an extension approach to the backtracking with look-ahead forwad checking method that adopts weighted partial satisfaction of soft; constraints that his been implemented to the development of an automated teaching assignment, timetabling system Determining the optimal solution for a teaching assignment problem is cl challenging task The objective is to construct a timetatble for professors from already scheduled courses that, satisfy both hard constraints (problem requirements such as no teacher should be assigned two courses at the same time) and soft. constraints (teacher preferences) based on fairness principle in distributing courses among professors The approach IS done mainly to modify the variable selection method and the value assignment technique taking into account. preferences and based on fairness principle optimized look-ahead backtracking method applied to the solution is presented and discussed along with computational results