RT Journal Article
T1 A model for timetabling problems with period spread constraints
A1 Lara Velázquez, Pedro
A1 López Bracho, Rafael
A1 Ramírez Rodríguez, Javier
A1 Yáñez, Javier
AB The generalized robust colouring problem (GRCP) deals with a robust colouring for a given graph with a fixed number of colours, not necessarily the chromatic number and considers the distance between colours as the penalization of complementary edges. This problem provides a way to solve timetabling problems that consider 'event spread constraints' such as 'there must be at least d days between two events'. Because this problem is NP-hard, a heuristic approach is necessary to produce good solutions in a reasonable amount of time for large instances. In this work a greedy randomized adaptive search procedure (GRASP) is proposed to solve GRCP, which was used in instances to schedule course lectures requiring from 30 to 120 h per week in total, in which the bound of the optimal solution is reached in almost every instance.
PB Stockton Press
SN 0160-5682
YR 2011
FD 2011
LK https://hdl.handle.net/20.500.14352/43672
UL https://hdl.handle.net/20.500.14352/43672
NO Lara-Velázquez, P., et al. «A Model for Timetabling Problems with Period Spread Constraints». Journal of the Operational Research Society, vol. 62, n.o 1, enero de 2011, pp. 217-22. DOI.org (Crossref), https://doi.org/10.1057/jors.2009.173.
DS Docta Complutense
RD 17 abr 2025