Modelling and solving an acyclic multi-period timetabling problem

Mirjana Cangalovic, J.A.M. Schreuder

    Research output: Contribution to journalArticleAcademicpeer-review

    5 Citations (Scopus)
    80 Downloads (Pure)


    In this article case of the class-teacher timetabling problem is described. This case takes into consideration a partial ordering between the topics of the curriculum and special requirements in respect to their daily lectures. The problem is modelled as a discrete lexicographisc optimization problem. A heuristic procedure foe solving the problem is developed. The method represents a combination of two different approaches: on the general level a heuristic approach typical for resource constrained project scheduling and on the the daily level a reduction to graph colouring.
    Original languageEnglish
    Pages (from-to)177-195
    Number of pages19
    JournalDiscrete applied mathematics
    Issue number3
    Publication statusPublished - 1992


    • Project management
    • Education
    • Timetabling
    • Heuristic
    • lexicographic optimization

    Fingerprint Dive into the research topics of 'Modelling and solving an acyclic multi-period timetabling problem'. Together they form a unique fingerprint.

    Cite this