Uma abordagem metaheurística para o problema de alocação de horário escolar no IFRN

Abstract

Every academic year, education institutions face the need to allocate their classes. The challenge lies in the ability to concile pedagogical needs, organizational resource constraints, and personal preferences. Motivated by the high complexity for combining teacher, student, and classroom availability, as well as various other constraints, the high school timetabling problem has long been studied by the academic community. In this context, (meta)heuristic approaches have been the method-of-choice when finding high-quality solutions in a feasible timespan. This work proposes a greedy randomized adaptative search procedure (GRASP) algorithm for the school timetabling problem targeting the technical courses oered at Instituto Federal de Educação Ciência e Tecnologia do Rio Grande do Norte (IFRN). To validate the proposed approach, real-world instances were built from data gathered at dierent campi. Results indicate the eectiveness of the algorithm, given the feasible solutions meeting all constraints initially considered while achieving high quality.