A fix-and-optimize heuristic for the ITC2021 sports timetabling problem

Autor: George H. G. Fonseca, Túlio A. M. Toffolo

Publikováno v: Journal of Scheduling. 25:273-286

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::787ea57e86ffa3a9d2abd8a88d3a18dc
https://doi.org/10.1007/s10951-022-00738-6

Late acceptance hill-climbing for high school timetabling

Autor: Haroldo Gambini Santos, George H. G. Fonseca, Eduardo G. Carrano

Publikováno v: Journal of Scheduling. 19:453-465

The application of the Late Acceptance Hill-Climbing (LAHC) to solve the High School Timetabling Problem is the subject of this manuscript. The original algorithm and two variants proposed here are tested jointly with other state-of-art methods to so

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::2f1ac6aad78238ecf7be87f03334dc8a
https://doi.org/10.1007/s10951-015-0458-5

Integer programming techniques for educational timetabling

Autor: George H. G. Fonseca, Haroldo Gambini Santos, Eduardo G. Carrano, Thomas Jacob Riis Stidsen

Publikováno v: Fonseca, G H G, Santos, H G, Carrano, E G & Stidsen, T J R 2017, ' Integer programming techniques for educational timetabling ', European Journal of Operational Research, vol. 262, no. 1, pp. 28-39 . https://doi.org/10.1016/j.ejor.2017.03.020

Educational timetabling problems require the assignment of times and resources to events, while sets of required and desirable constraints must be considered. The XHSTT format was adopted in this work because it models the main features of educationa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::62e32323185588e4d455634b053aeb89
https://orbit.dtu.dk/en/publications/6fd7e531-7e3e-4c38-aa8f-004a0bbc3010

A SA-VNS approach for the High School Timetabling Problem

Autor: George H. G. Fonseca, Túlio Ângelo Machado Toffolo, Marcone Jamilson Freitas Souza, Haroldo Gambini Santos, Samuel Souza Brito

Publikováno v: Repositório Institucional da UFOP
Universidade Federal de Ouro Preto (UFOP)
instacron:UFOP

The 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 Compet

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b81eaabb2a1b1cd0c6cb87cea2f49990
https://doi.org/10.1016/j.endm.2012.10.023

Memetic Algorithms for the High School Timetabling Problem

Autor: Haroldo Gambini Santos, George H. G. Fonseca

Publikováno v: IEEE Congress on Evolutionary Computation

This work presents the application of Memetic Algorithms for the High School Timetabling Problem. The addressed model of the problem was proposed by the Third International Timetabling Competition (ITC), which released many instances from educational

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::873be7fba0286b24466155ec29ce0a40
https://doi.org/10.1109/cec.2013.6557632