Deterministic version of the dynamic task of assigning labor resources

Abstract

The article deals with a deterministic variant of the dynamic task of assigning labor resources. There are labor resources, wishing to find a job, and many enterprises offering vacancies. Appointment of workers can be done in an optimal way: for a given initial state of the process, maximize the total income of the enterprises. The problem can be solved using the dynamic programming technique - Bellman functional equations. A numerical example is given