This paper focuses on researching, analyzing, and evaluating universities scheduling problem which requires scheduling multiple classes, different teachers and classrooms, along with various constraints such as teacher's teaching hours, classroom capacity, and other resources. In order to solve this problem, Tabu search algorithm has been proposed, which based on searching for the best solutions for adaptive memory and reactive exploration. The constraints and limitations of the problem will be used to create a list of Tabu conditions to ensure that non-optimal solutions will not be repeated. After initializing and updating the adaptive memory, the Tabu search algorithm will search for the next solutions based on the Tabu conditions and adaptive memory. In this way, the Tabu search algorithm can find optimal solutions for this scheduling problem for universities. However, there are many challenges and limitations in the application of this algorithm, such as the large number of constraints to be follow, the determination of suitable parameters, and the dependence on the programmer's experience.