Abstract
A college timetable is a temporal arrangement of a set of classes and classrooms which all given constraints are satisfied. Timetabling has long been known to belong to the class of problems called NPhard. This paper introduces a practical timetabling algorithm capable of taking care of both strong and weak constraints effectively, used in an automated timetabling system for a 2-year college. It presents what kind of the hard and soft constraints are imposed on the timetabling at the college and how to deal with them. It explains the data structures used to check the constraints. It also present the strategies for scheduling courses and for allocating classrooms to courses in the timetables. It shows some experiment results obtained in the application of the proposed algorithm to the college timetabling.
Cite
CITATION STYLE
Hwang, K. S., Lee, K. M., & Jeon, J. (2004). A practical timetabling algorithm for college lecture-timetable scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3215, pp. 817–825). Springer Verlag. https://doi.org/10.1007/978-3-540-30134-9_109
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
