Formulações exata e heurística para o problema de programação de horários da Universidade Federal de Sergipe

• Autor(a) principal: Menezes, Dimitri Carvalho
• Data de Publicação: 2017
• Tipo de documento: Trabalho de conclusão de curso
• Idioma: por
• Título da fonte: Repositório Institucional da UFS
• Texto Completo: https://ri.ufs.br/handle/riufs/6839
• topic: Ciência da computação; Ensino de computação; Otimização combinatória; Programação de horários; Método heurístico; Programação linear; Linear programming; Combinatorial optimization; Timetabling problem; Heuristic method; CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::METODOLOGIA E TECNICAS DA COMPUTACAO

Curriculum based timetabling problem is a combinatorial optimization problem and considered as a NP-Hard problem. The biggest difficulty of this problem is to allocate classes for teachers, classrooms and schedules without conflicts of time and space. Relying on curriculum or curriculum matrix means that curriculum schedules should not be in conflict. This is a usual problem in universities and a general formulation is not a good deal to all universities, as institutional rules and restrictions change from one university to another. The construction of a mathematical model can be the basis for new studies or even the construction of a tool that simplifies the organization of teachers schedules of a university.Therefore, this study aimed to build a specific model for the Federal University of Sergipe with the idea of maximizing teachers’ preferences to teach classes at specific time. In addition, to verify how difficult it is to solve this problem increased with the specific restrictions of the university, it was used branch and bound exact method and Iterated Local search heuristic method. The results show that the exact method can obtain solutions after using a lot of time and computational resources. However, it was not possible to prove the optimality of the solutions within the given time limit. While the heuristic method can obtain solutions close to or better than the exact method, using less time and