Comparing Variations of the Greedy Strategy to Find the Optimal Sugar Beet Processing Schedule

Abstract

The article presents a mathematical model of sugar beet processing and finding the optimal schedule for this processing. Such task, with fully known data, reduces to a well-known assignment problem. However, in many applied problems of discrete optimization, it is not possible to use classical methods to find a solution in practice. This happens as a result of the fact that when setting the task at the initial moment of time, there is no complete information about some data. For example, in the assignment problem, information about the matrix on the basis of which the objective function is constructed may be incomplete. As a result, in practice it is necessary to search for heuristic algorithms for various possible situations. In particular, the greedy algorithm, as well as its various variations, claims to be such an algorithm. Computational experiment is being conducted that allows us to understand which of the variations of the greedy algorithm give an acceptable result when building an optimal schedule strategy for processing sugar beet batches.