Modelling and solving an acyclic multi-period timetabling problem

Mirjana Cangalovic, J.A.M. Schreuder

    Research output: Contribution to journalArticleAcademicpeer-review

    5 Citations (Scopus)
    49 Downloads (Pure)

    Abstract

    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
    Volume35
    Issue number3
    DOIs
    Publication statusPublished - 1992

    Fingerprint

    Timetabling
    Coloring
    Curricula
    Scheduling
    Modeling
    Heuristics
    Resource-constrained Project Scheduling
    Partial ordering
    Discrete Optimization
    Graph Coloring
    Optimization Problem
    Requirements

    Keywords

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

    Cite this

    Cangalovic, Mirjana ; Schreuder, J.A.M. / Modelling and solving an acyclic multi-period timetabling problem. In: Discrete applied mathematics. 1992 ; Vol. 35, No. 3. pp. 177-195.
    @article{fd765e0d1c534902a4ff0fe4a5ff9c9e,
    title = "Modelling and solving an acyclic multi-period timetabling problem",
    abstract = "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.",
    keywords = "Project management, Education, Timetabling, Heuristic, lexicographic optimization",
    author = "Mirjana Cangalovic and J.A.M. Schreuder",
    year = "1992",
    doi = "10.1016/0166-218X(92)90243-4",
    language = "English",
    volume = "35",
    pages = "177--195",
    journal = "Discrete applied mathematics",
    issn = "0166-218X",
    publisher = "Elsevier",
    number = "3",

    }

    Modelling and solving an acyclic multi-period timetabling problem. / Cangalovic, Mirjana; Schreuder, J.A.M.

    In: Discrete applied mathematics, Vol. 35, No. 3, 1992, p. 177-195.

    Research output: Contribution to journalArticleAcademicpeer-review

    TY - JOUR

    T1 - Modelling and solving an acyclic multi-period timetabling problem

    AU - Cangalovic, Mirjana

    AU - Schreuder, J.A.M.

    PY - 1992

    Y1 - 1992

    N2 - 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.

    AB - 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.

    KW - Project management

    KW - Education

    KW - Timetabling

    KW - Heuristic

    KW - lexicographic optimization

    U2 - 10.1016/0166-218X(92)90243-4

    DO - 10.1016/0166-218X(92)90243-4

    M3 - Article

    VL - 35

    SP - 177

    EP - 195

    JO - Discrete applied mathematics

    JF - Discrete applied mathematics

    SN - 0166-218X

    IS - 3

    ER -