Abstract

In this paper, we propose a new time-dependent heu-ristic algorithm for post enrolment-based course timetabling prob-lem. The algorithm operates in two stages: a constructive phase is proposed to insert events into the timetable whilst obeying most hard constraints, and a hill-climbing phase is designed to ensure the timetable meeting all the hard constraints. Each stage is allocated a time limit. The experimental results on instances from the second international timetabling competition show that our algorithm is efficient and competitive with other effective algorithms.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.