University Timetabling Problem: An analysis of the state of the art

Authors

  • Marco Antonio Aguirre Lam Instituto Tecnológico de Ciudad Madero
  • Fausto Balderas Instituto Tecnológico de Ciudad Madero
  • Nelson Rangel-Valdez Instituto Tecnológico de Ciudad Madero
  • Jose A. Martinez-Flores Instituto Tecnológico de Ciudad Madero
  • Alan G. Aguirre L Instituto Tecnológico de Ciudad Madero
  • José A. Pérez-Vázquez Instituto Tecnológico de Ciudad Madero

DOI:

https://doi.org/10.61467/2007.1558.2025.v16i3.852

Keywords:

Timetabling Problem, Combinatorial Optimization

Abstract

The University Course Timetabling Problem is regarded as one of the most significant administrative activities in academic institutions. It is framed as a combinatorial optimisation problem involving the scheduling of courses, students, lecturers, and classrooms, making it extremely complex. This work presents an analytical study of the Timetabling Problem, including its classifications, techniques, advantages, disadvantages, and a case study based on the model implemented at the Instituto Tecnológico de Ciudad Madero.

Downloads

Published

2025-07-14

How to Cite

Aguirre Lam, M. A., Balderas, F., Rangel-Valdez, N., Martinez-Flores, J. A., Aguirre L, A. G., & Pérez-Vázquez, J. A. (2025). University Timetabling Problem: An analysis of the state of the art. International Journal of Combinatorial Optimization Problems and Informatics, 16(3), 489–498. https://doi.org/10.61467/2007.1558.2025.v16i3.852

Issue

Vol. 16 No. 3 (2025)

Section

Recent Advances on Soft Computing

License

Copyright (c) 2025 International Journal of Combinatorial Optimization Problems and Informatics

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Most read articles by the same author(s)