An overview of curriculum-based course timetabling

Andrea Bettinelli, Valentina Cacchiani, Roberto Roberti, Paolo Toth

    Research output: Contribution to journalJournal articleResearchpeer-review

    1 Downloads (Pure)

    Abstract

    In 2007, the Second International Timetabling Competition (ITC-2007) has been organized and a formal definition of the Curriculum-Based Course Timetabling (CB-CTT) problem has been given, by taking into account several real-world constraints and objectives while keeping the problem general. CB-CTT consists of finding the best weekly assignment of university course lectures to rooms and time periods. A feasible schedule must satisfy a set of hard constraints and must also take into account a set of soft constraints, whose violation produces penalty terms to be minimized in the objective function. From ITC-2007, many researchers have developed advanced models and methods to solve CB-CTT. This survey is devoted to review the main works on the topic, with focus on mathematical models, lower bounds, and exact and heuristic algorithms. Besides giving an overview of these approaches, we highlight interesting extensions that could make the study of CB-CTT even more challenging and closer to reality.
    Original languageEnglish
    JournalT O P
    Volume23
    Issue number2
    Pages (from-to)313-349
    Number of pages37
    ISSN1134-5764
    DOIs
    Publication statusPublished - 2015

    Bibliographical note

    This invited paper is discussed in the comments available at doi:10.​1007/​s11750-015-0362-3, doi:10.​1007/​s11750-015-0363-2, doi:10.​1007/​s11750-015-0364-1, doi:10.​1007/​s11750-015-0365-0.

    Keywords

    • University timetabling
    • Curriculum-based course timetabling
    • Survey
    • Models
    • Exact algorithms
    • Heuristic algorithms

    Fingerprint

    Dive into the research topics of 'An overview of curriculum-based course timetabling'. Together they form a unique fingerprint.

    Cite this