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

 

Wedi'i Gadw mewn:
Manylion Llyfryddiaeth
Awdur: Cáceres Espinoza, Ramiro José
Fformat: artículo original
Statws:Versión publicada
Dyddiad Cyhoeddi:1998
Disgrifiad: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.
Gwlad:Portal de Revistas UCR
Sefydliad:Universidad de Costa Rica
Repositorio:Portal de Revistas UCR
Iaith:Español
OAI Identifier:oai:archivo.portal.ucr.ac.cr:article/159
Mynediad Ar-lein:https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/159
Allweddair:operations reseach
combinatorial optimization
schedule problem
investigación de operaciones
optimización combinatoria
problema de horarios