Abstract: In this paper, by establishing the multipleobjective 01 integer programming model which keeps the original curriculum time constant, we propose a method for solving university course timetabling problem. This method aims to find the shortest path for class and keep the utilization of classroom resource balanced. In the model, we see the first target as a constraint condition, using the idea “when a class’s two courses are arranged in a row, then the two courses are arranged in the same classroom”, while we see the second target as the objective function. Eventually the constrained optimization problem is solved by the filter algorithm. The simulation results on small amount of data are also given to show the efficiency of the proposed method.

Key words: course timetabling problem, integer programming model, distance of two courses, balanced use of classroom resources