This paper studies a fortnightly university course timetabling problem. In this research, the Industrial Engineering Department of Ferdowsi University of Mashhad (Iran) is considered as the case study for investigation. An integer linear programming model is developed for the problem and is solved using ILOG CPLEX 12.1 solver. Also, a branch-and-bound algorithm is developed to find optimal solutions in which both lecturers and students\\\\\\\' preferences are considered. Regarding to the limited size of the case study, the computational results indicate that the developed algorithm is efficient and is able to find good solutions in a reasonable time.

Keywords