a genetic algorithm in a schedule problem with special constraints
Ramírez (2001) introduced the generalized robust coloring problem (GRCP), this problem lets solve timetabling problems which considers constraints such as: two events can not be assigned at the same time and there must be at least d days between two events.The GRCP deals with a robust coloring for a...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Universidad de Costa Rica
2011-07-01
|
Series: | Revista de Matemática: Teoría y Aplicaciones |
Online Access: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/2095 |