### Impacto

### Downloads

Downloads per month over past year

Lara Velázquez, P. and López Bracho, R. and Ramírez Rodríguez, J. and Yáñez, Javier
(2011)
*A model for timetabling problems with period spread constraints.*
Journal of the Operational Research Society, 62
(1).
pp. 217-222.
ISSN 0160-5682

Official URL: http://www.palgrave-journals.com/jors/journal/v62/n1/pdf/jors2009173a.pdf

## Abstract

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.

Item Type: | Article |
---|---|

Uncontrolled Keywords: | Graphs; heuristics; lecture-timetabling; robust colouring |

Subjects: | Sciences > Mathematics > Mathematical statistics |

ID Code: | 20151 |

Deposited On: | 27 Feb 2013 09:44 |

Last Modified: | 02 Jun 2016 17:13 |

### Origin of downloads

Repository Staff Only: item control page