Abstract
An alternative method of data handling in the heuristic algorithm for University timetables is suggested and methods of including various constraints on the final solution are given. The extended algorithm includes the allocation of suitable rooms to lectures, the consideration of lecturers' preferences, dynamic allocation of a lecturer's free day, and the spreading of similar lectures over the week.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.