In some cases, the problems of combinatorial oxidation (COP), such as the Calendarisation of Time Problem (CTTP), can be solved using Operational Research (IO) techniques; however, when the problem increases in size, finding a solution becomes more complex. This type of problem is NP-hard and therefore requires procedures such as metapheurlistic methods in order to solve the problem. This work addresses a real problem in a Mexican Higher Education Institution regarding the calendarisation of working hours based on the Curricula (CB-CTT). Each institution has its own operational rules, and the problem is therefore unique as it retains its own characteristics. First, as part of the contribution to the solution of the problem, a Mediation Software (MS) was developed in order to organise raw data and remove the severe restriction on curricula. Subsequently, the problem was divided into five instances, in accordance with the courses that share the same physical space, which were resolved using the traditional simulated annealing algorithm (SA). The problem was satisfactorily resolved, obtaining the allocation of 9620 sessions in approximately 174.5 hours, providing a solution without partitioning the problem into two sub-problems, positively reducing the time for preparing the hours, providing a workable and error-free timetable for the entire university.