Skip to Main Content
The university timetabling problem deals with scheduling courses and determining the lecturer and the location of each course in a semester. This problem belongs to NP-hard problems, which means that solving the problem requires smart algorithms. In this paper, we propose a linear formulation of the problem which has been implemented using the GLPG modeling language.
Computer and Electrical Engineering, 2009. ICCEE '09. Second International Conference on (Volume:2 )
Date of Conference: 28-30 Dec. 2009