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 language | English |
|---|---|
| Pages (from-to) | 177-195 |
| Number of pages | 19 |
| Journal | Discrete applied mathematics |
| Volume | 35 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1992 |
Keywords
- 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
Cangalovic, M., & Schreuder, J. A. M. (1992). Modelling and solving an acyclic multi-period timetabling problem. Discrete applied mathematics, 35(3), 177-195. https://doi.org/10.1016/0166-218X(92)90243-4