Vos, M. A. de (2014) Solving the Dutch High School Timetabling Problem using Linear Optimization. Master's Thesis / Essay, Mathematics.
|
Text
Mirjam_DeVos_2014_TWM.pdf - Published Version Download (587kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
Toestemming.pdf - Other Restricted to Backend only Download (16kB) |
Abstract
High School Timetabling (HSTT) is a research field that tries to solve the problem of making good timetables for high schools. Since this HSTT problem is very hard (NP-complete), it is not possible to solve the problem to optimality for every high school within a reasonable amount of time. During my master research the HSTT problem for the Netherlands was formulated as a Mixed Integer Linear Program (MILP), which was implemented in Delphi. Different decompositions which use this MILP in two or three phases were constructed and compared. An example of this is to apply the MILP in the first phase only to teachers, and use the corresponding solution in the second phase to fix the days during which teachers are allowed to teach. The general Linear Programming solvers CPLEX and Gurobi were used to solve the MILP’s.
| Item Type: | Thesis (Master's Thesis / Essay) |
|---|---|
| Degree programme: | Mathematics |
| Thesis type: | Master's Thesis / Essay |
| Language: | English |
| Date Deposited: | 15 Feb 2018 07:57 |
| Last Modified: | 15 Feb 2018 07:57 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/11707 |
Actions (login required)
 |
View Item |