A model for timetabling problems with period spread constraints / Lara-Velázquez, P. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 217–222 Titre : A model for timetabling problems with period spread constraints Type de document : texte imprimé Auteurs : Lara-Velázquez, P., Auteur ; López-Bracho, R., Auteur ; Ramírez-Rodríguez, J., Auteur Année de publication : 2011 Article en page(s) : pp. 217–222 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Heuristics Lecture-timetabling Robust colouring Index. décimale : 001.424 Résumé : 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. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009173a.html [article] A model for timetabling problems with period spread constraints [texte imprimé] / Lara-Velázquez, P., Auteur ; López-Bracho, R., Auteur ; Ramírez-Rodríguez, J., Auteur . - 2011 . - pp. 217–222. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 217–222 Mots-clés : Heuristics Lecture-timetabling Robust colouring Index. décimale : 001.424 Résumé : 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. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009173a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire