Una versión profesor-grupo-aula del problema de horarios
Guardado en:
| Údar: | |
|---|---|
| Formáid: | artículo original |
| Stádas: | Versión publicada |
| Fecha de Publicación: | 1998 |
| Cur Síos: | 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. |
| País: | Portal de Revistas UCR |
| Institiúid: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Teanga: | Español |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/159 |
| Rochtain Ar Líne: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/159 |
| Palabra clave: | operations reseach combinatorial optimization schedule problem investigación de operaciones optimización combinatoria problema de horarios |