Please use this identifier to cite or link to this item:
|Title:||A heuristic approach to scheduling university timetables||Authors:||Loo, E.H.
|Issue Date:||1986||Citation:||Loo, E.H.,Goh, T.N.,Ong, H.L. (1986). A heuristic approach to scheduling university timetables. Computers and Education 10 (3) : 379-388. ScholarBank@NUS Repository.||Abstract:||This paper describes a heuristic approach to the university timetabling problem. The approach can satisfy complex conditions such as pre-assignment of classes, provision of lunch and dinner breaks, reservation or blocking of certain periods and some other requirements. The approach starts with a blank timetable in which classes are allocated into the timetable according to various criteria, the criteria themselves changing with the situation. A good heuristic solution to the problem can be obtained after a few trials. The method can be used to construct an integrated timetable for a number of academic departments. This would result in better resource utilization and provide a means for further resource development studies. The limitations of the system and ideas for its further enhancement are also discussed. © 1986.||Source Title:||Computers and Education||URI:||http://scholarbank.nus.edu.sg/handle/10635/54240||ISSN:||03601315|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 18, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.