Brito, Samuel SouzaFonseca, George Henrique Godim daToffolo, Túlio Ângelo MachadoSantos, Haroldo GambiniSouza, Marcone Jamilson Freitas2015-01-262015-01-262012BRITO, S. S. et al. A SA-VNS approach for the high school timetabling problem. Electronic Notes in Discrete Mathematics, v. 39, p. 169-176, 2012. Disponível em: <http://www.sciencedirect.com/science/article/pii/S1571065312000248#>. Acesso em: 22 jan. 2015.1571-0653http://www.repositorio.ufop.br/handle/123456789/4374The High School Timetabling Problem consists in assigning timeslots and resources to events, satisfying constraints which heavily depend on the specific institution. This work deals with the problem of the ongoing III International Timetabling Competition (ITC), which includes a diverse set of instances from many educational institutions around the world. We proposed an approach based on Simulated Annealing and Variable Neighborhood Search metaheuristics. One important structural feature of our approach is the use of the Kingston’s High School Timetabling Engine (KHE) to generate initial solutions combined with the multi-neighborhood search. Such approach led us to the finals of the ongoing competition.en-USVariable neighborhood searchSimulated annealingHigh school timetabling problemArtigo publicado em periodicoO periódico Electronic Notes in Discrete Mathematics concede permissão para depósito do artigo no Repositório Institucional da UFOP. Número da licença: 3552521492490.https://doi.org/10.1016/j.endm.2012.10.023