Please use this identifier to cite or link to this item:
DC FieldValue
dc.titleA heuristic approach to scheduling university timetables
dc.contributor.authorLoo, E.H.
dc.contributor.authorGoh, T.N.
dc.contributor.authorOng, H.L.
dc.identifier.citationLoo, 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.
dc.description.abstractThis 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.
dc.contributor.departmentINDUSTRIAL & SYSTEMS ENGINEERING
dc.description.sourcetitleComputers and Education
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Jul 21, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.