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

 

Salvato in:
Dettagli Bibliografici
Autore: Cáceres Espinoza, Ramiro José
Natura: artículo original
Status:Versión publicada
Data di pubblicazione:1998
Descrizione: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.
Stato:Portal de Revistas UCR
Istituzione:Universidad de Costa Rica
Repositorio:Portal de Revistas UCR
Lingua:Español
OAI Identifier:oai:portal.ucr.ac.cr:article/159
Accesso online:https://revistas.ucr.ac.cr/index.php/matematica/article/view/159
Keyword:operations reseach
combinatorial optimization
schedule problem
investigación de operaciones
optimización combinatoria
problema de horarios