Abstract
As well as nearly always belonging to the class of NP-complete problems, university timetabling problems can be further complicated by the often idiosyncratic requirements imposed by the particular institution being considered. It is perhaps due to this characteristic that in the past decade-or-so, metaheuristics have become increasingly popular in the field of automated timetabling. In this paper we carry out an overview of such applications, paying particular attention to the various methods that have been proposed for dealing and differentiating between constraints of varying importance. Our review allows us to classify these algorithms into three general classes, and we make some instructive comments on each of these.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
