With an increase in the number of students and the number of courses offered by universities, examination scheduling based on the available facilities becomes much more complicated. At present, examinations must be appropriately scheduled not only based on the offered courses, but also with respect to the rooms’ capacities, available time-slots, days-off rules and other soft and hard constraints. From the Mathematical Programming point of view, timetabling and scheduling problems are somewhat related to Assignment problems, but have additional constraints that make them computationally challenging. Timetabling problems are NP-hard problems for which there is unlikely to be an economically viable method for finding the optimal solution. In our studies, we use Python interfaced with CPLEX as optimization software to find approximately optimal results for large problems in reasonable time.
| Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:NSHD.ca#10222/15446 |
| Date | 07 August 2012 |
| Creators | Setayesh, Azin |
| Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
| Language | en_US |
| Detected Language | English |
Page generated in 0.0019 seconds