The Timetabling Scheduling problem is common in many universities. This problem has been solved using a wide variety of strategies, which can be found in the scientific literature, each with a particular perspective commonly involving different sets of constraints. The work presented in this paper shows the solution of the problem in the Polytechnic University of Victoria, Mexico. There, it takes two weeks to manually solve the problem. The research proposed the use of Simulated Annealing to reduce the time required to create the schedules. The resulting methodology relaxed the problem into three simpler subproblems that solve the assignment, distribution, and scheduling of classes. An analysis of the performance of the SA over different evaluation functions is presented. The results show an improvement in the time required for the construction, reducing it to less than one minute.
© 2008-2025 Fundación Dialnet · Todos los derechos reservados