The problem of uniform distribution requirements for nodes of the computer network

The tasks of computing organizations in computer networks have become very popular lately. This is the scheduling of solving many problems on a single computer network and various tasks of loading nodes of the computer network. The article deals with the problem of uniform loading of nodes of the computer network. As a criterion, the maximum relative loading of nodes by the amount of memory is taken. The problem is generalized to the case of two criteria. Heuristic algorithms for solving problems are offered, which favorably differ from the algorithm of branches and boundaries used earlier to obtain estimates based on the method of network programming. With a large number of requirements, this method of obtaining estimates leads to a large amount of computation, since obtaining estimates requires, at each step, solutions of systems of linear inequalities.