Keywords
combinatorial optimization
schedule problem
investigación de operaciones
optimización combinatoria
problema de horarios
How to Cite
Abstract
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.
References
Even, S.; Idtai, A.; Shamir, A. (1976) “On the complexity of time-table and multicom-modity flow problems”, SIAM Journal on Computing5: 691–703.
Jungnickel, D. (1987) Graphen, Netzwerke und Algorithmen. Bibliographiches Institut Mannheim/Wien/Zurich.
Thulasiraman, K.; Swamy, M.N.S. (1982) Graphs: Theory and Algorithms. John Wiley & Sons, New York.
de Werra, D. (1985) “Graphs, Hypergraphs and Timetabling”, Methods of Operations Research 49: 201–213.
de Werra, D. (1981) “Remarks on the requirement matrix of school timetabling. Problems and regular embeddings”, European Journal of Operational Research 6: 298–301.
de Werra, D. (1979) “On the use of alternating chains and hypergraphs in edge coloring”, Journal of Graph Theory 3: 175–182.