Una versión profesor-grupo-aula del problema de horarios
সংরক্ষণ করুন:
| লেখক: | |
|---|---|
| বিন্যাস: | artículo original |
| বর্তমান অবস্থা: | Versión publicada |
| প্রকাশনার তারিখ: | 1998 |
| বিবরন: | 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. |
| দেশ: | Portal de Revistas UCR |
| প্রতিষ্ঠান: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| ভাষা: | Español |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/159 |
| অনলাইন ব্যবহার করুন: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/159 |
| মুখ্য শব্দ: | operations reseach combinatorial optimization schedule problem investigación de operaciones optimización combinatoria problema de horarios |