Upemor online dating
This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
This paper proposes a real mathematical constraint satisfaction model which defines the timetabling problem in the Faculty of Chemical Sciences and Engineering (FCSE) at the Autonomous University of Morelos State, Mexico.
In the field of education, the efficient establishment and planning of schedules improve the use and organization of staff, schedules, classrooms, and equipment.
The improved use of resources boosts academic performance for students and teachers.
If this is the case, the best solution for dealing with an NP problem is to use computational heuristics which allow for constraints in polynomial time and yield a solution very close to the global optimum .
This paper focuses specifically on the problem of the allocation of expensive resources (classrooms) in university scheduling.
The academic programming schedule is a specific problem within the general problem of resource allocation.
This measure enables the selection of the most efficient algorithm for solving a problem.
Resources that are considered critical or scarce are the classrooms, since they are not resources that are readily available.
This is why the number, characteristics, and capacity of classrooms must be considered when scheduling, as one of the features and restrictions of the educational institution.
The complexity theory classifies the universe of problems according to the inherent complexity of solving them .
This depends on whether there is an exact algorithm in polynomial time behavior and whether there is proof of optimality for solving the problem in question.
The goal of the scheduling problem in education is to schedule the courses in an academic period (trimester, quarter, or semester).