DocumentCode
3089686
Title
A Linear Solution for the University Timetabling Problem
Author
Davoudzadeh, Maboud ; Rafeh, Reza ; Rashidi, Roya
Volume
2
fYear
2009
fDate
28-30 Dec. 2009
Firstpage
54
Lastpage
57
Abstract
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.
Keywords
computational complexity; educational courses; linear programming; scheduling; GLPG modeling language; NP-hard problems; courses scheduling; problem solving; smart algorithms; university timetabling problem; Constraint optimization; Educational institutions; Genetic algorithms; Linear programming; NP-hard problem; Processor scheduling; Programming profession; Simulated annealing; DNA sequences; Human Identification; Neural Network;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Electrical Engineering, 2009. ICCEE '09. Second International Conference on
Conference_Location
Dubai
Print_ISBN
978-1-4244-5365-8
Electronic_ISBN
978-0-7695-3925-6
Type
conf
DOI
10.1109/ICCEE.2009.131
Filename
5380143
Link To Document