Application of greedy algorithms for the formation of the educational schedule in the higher education

Abstract

The problem of improving the quality of the organization of the educational process in a higher educational institution (university) is solved by using greedy algorithms. This task is the main one in the activity of the dispatching service of each university. A well-prepared schedule should ensure a uniform load of student groups and faculty. A greedy algorithm is an algorithm consisting in making locally optimal decisions at each stage, assuming that the final solution also turns out to be optimal. A greedy resource allocation algorithm refers to an algorithm according to which the resource allocation process can be represented as a sequence of steps. At each step, an optimal distribution of some resources occurs under certain conditions, which does not change in the future. Numerous attempts to automate the process of forming the university curriculum did not solve the problem in full. Accordingly, in order to solve this problem more effectively, as well as reduce the time and money spent on resource allocation, it is necessary to optimize existing solutions. The purpose of this work is to develop an algorithm that will improve the quality of curriculum formation based on the use of greedy algorithms.