Abstract
A greedy resource allocation algorithm is understood as an algorithm according to which the resource allocation process can be represented as a sequence of steps. At each step, an optimal, under certain conditions, distribution of a part of the resources occurs, which does not change in the future. The problem of improving the quality of the organization of the educational process in a higher educational institution is solved on the basis of the use of greedy algorithms. A well-designed timetable should ensure an even workload of student groups and faculty. The purpose of this work is to develop an algorithm that can improve the quality of the formation of the educational schedule based on the use of greedy algorithms.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call