Comparing Variations of the Greedy Strategy to Find the Optimal Sugar Beet Processing Schedule
Journal: BIO Web of Conferences
Year: 2024

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