Una versión profesor-grupo-aula del problema de horarios

 

Zapisane w:
Opis bibliograficzny
Autor: Cáceres Espinoza, Ramiro José
Format: artículo original
Status:Versión publicada
Data wydania:1998
Opis:We present the schedule problem that include, in addition to the assignment of timing to teaching activities, the assignment of these activities to classrooms with different capacities, and that are supposed available at every time.We prove that a simple condition guaranties that activities at each time can be arranged in the classrooms, and we conclude that assignement of activities using the minimun number of time can be made in polynomial time.
Kraj:Portal de Revistas UCR
Instytucja:Universidad de Costa Rica
Repositorio:Portal de Revistas UCR
Język:Español
OAI Identifier:oai:portal.ucr.ac.cr:article/159
Dostęp online:https://revistas.ucr.ac.cr/index.php/matematica/article/view/159
Słowo kluczowe:operations reseach
combinatorial optimization
schedule problem
investigación de operaciones
optimización combinatoria
problema de horarios