A Linear Solution for the University Timetabling Problem

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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Davoudzadeh, M., Rafeh, R., Rashidi, R.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Constraint optimization DNA sequences Educational institutions Genetic algorithms Human Identification Linear programming Neural Network NP-hard problem Processor scheduling Programming profession Simulated annealing
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
DOI:	10.1109/ICCEE.2009.131