A Mathematical Programming Model for High School Timetabling Problem

Ingeniería y Ciencia

Maya Duque, Pablo Andrés¹  Marín Ángel, Juan Camilo¹ 

[1] Universidad de Antioquia, Medellín, Colombia

关键词: integer programming;    timetabling problem;    computational complexity;   

DOI  :  10.17230/ingciencia.12.23.3

学科分类：工程和技术（综合）

来源: Universidad E A F I T

【 摘 要 】

This paper presents a mathematical programing model that supports the design of timetables of classes in primary and secondary educational institutions, allowing the decision maker to take into account the constraints and variables that are commonly associated to this problem. Our model differs from most of those in the literature as the objective function aims at maximizing the number of blocks, two consecutive hours of lecture devoted to the same subject, which favors the learning process, optimizes teachers' agendas by reducing idle times and reduces cost and contractual difficulties. The model is validated using a real instance of a middle size institution for which the current timetable is considerably improved. Additionally, computational experiments with larger instances were carried on in order to test the capacity of the model for which promising results were obtained.

【 授权许可】

CC BY