Abstract
The paper presents an updated revision of the state of the art in the curriculum-based course timetabling problem (CB-CTT). CB-CTT has been proposed for one track of the Second International Timetabling Competition (ITC-2007). Since then, several solution methods have been proposed and their results could have been tracked thanks to the web platform hosted at http://satt.diegm.uniud.it/ctt. In the following lines, some thoughts and remarks will be given, mainly from the SAT-solving point of view. First, we review some facts about CB-CTT and remark some characteristics that, to our understanding, may have helped the community to do better research. Later, from the different cited approaches, we observe two things: (1) how the problem has been represented (the modeling language) and (2) the solving algorithms. Finally, we close this comment pointing out some possible future work in CB-CTT.
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.
