In contrast to the classical transport problem, according to the minimum total time criterion, it is assumed that resources are processed both at the source points and at the destination points, the duration of which depends linearly on the volume of the processed batch. This takes into account both the availability of the vehicles involved and their characteristics, such as load capacity. The use of the Hungarian method is justified for the distribution of resources along the available routes. To solve the problem of distribution of available vehicles by starting points, taking into account the load capacity of vehicles, it is proposed to use the method of dynamic programming. An illustrative example and distribution of delivery means using the "Search for a solution" command in MS Excel are considered.

Keywords: transport task, minimum time criterion, processing costs, load capacity