SciELO - Scientific Electronic Library Online

vol.20 issue2General guidelines solution for linear programming with fuzzy coefficientsSimulation models generator: Applications in scheduling author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand




Related links

  • Have no similar articlesSimilars in SciELO


Revista de Matemática Teoría y Aplicaciones

Print version ISSN 1409-2433


ABOYTES-OJEDA, Mario; LAUREANO-CRUCES, Ana Lilia  and  RAMIREZ-RODRIGUEZ, Javier. Tabu search algorithm for a variation of the coloring problem. Rev. Mat [online]. 2013, vol.20, n.2, pp.215-230. ISSN 1409-2433.

The generalized robust coloring problem (GRCP) resolves timetabling problems that consider special constraints. As a generalization of the robust coloring problem, which is in turn a generalization of the coloring problem, the GRCP is then a NP-Complete problem, so it is necessary to use approximate methods to find good solutions in a reasonable computation time. This paper presents a tabu search algorithm to schedule cases from 30 to 180 hours per week, for some of them it found the optimal solution, in other cases, the solution obtained exceeds the best known solution. It also presents examples of greater size to the known, obtaining very competitive results, which can be verified by the absence of class conflict.

Keywords : robust coloring; timetabling problems; heuristics.

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )


Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License