Search for collections on Wintec Research Archive

A Linear Solution for the University Timetabling Problem


Full text not available from this repository.


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.

Item Type: Paper presented at a conference, workshop or other event, and published in the proceedings
Uncontrolled Keywords: Linear programming, Processor scheduling, NP-hard problem, Constraint optimization, Programming profession, Educational institutions, Genetic algorithms, Simulated annealing
Subjects: Q Science > QA Mathematics > QA76 Computer software
Divisions: Schools > Centre for Business, Information Technology and Enterprise > School of Information Technology
Depositing User: Reza Rafeh
Date Deposited: 11 Jan 2017 01:04
Last Modified: 21 Jul 2023 04:35

Actions (login required)

View Item
View Item