Skip to main content
Article thumbnail
Location of Repository

Solving the Dutch High School Timetabling Problem using Linear Optimization

By M. A. de Vos

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.

Year: 2014
OAI identifier: oai:ub.rug.nl:dbi/5375d52c603be
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://scripties.fwn.eldoc.ub.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.