PROBLEMS OF NETWORK PLANNING WITH RESTRICTIONS ON LABOR RESOURCES

UDC 519.86

 

Busnyuk Nikolay Nikolaevich − PhD (Physics and Mathematics), Associate Professor, Assistant Professor, the Department of Information Systems and Technologies. Belarusian State Technological University (13a, Sverdlova str., 220006, Minsk, Republic of Belarus). E-mail: busnnn@belstu.by

 

DOI: https://doi.org/10.52065/2520-6141-2023-272-2-16 (In Russian).

 

Key words: network planning, network graph, labour resourses, renewable resourses, critical path, reserve time, algorithm.

 

For citation: Busnyuk N. N. Problems of network planning with restrictions on labor resourses. Proceedings of BSTU, issue 3, Physics and Mathematics. Informatics, 2023, no. 2 (272), pp. 111–115. DOI: 10.52065/2520-6141-2023-272-2-16 (In Russian).

 

Abstract

A classification of modified network planning tasks is carried out depending on the number of jobs, as well as the number and productivity of workers. Some assertions that are typical for typical problems are proved. Algorithms for assigning weights to arcs and finding the critical path are given. Four types of tasks are distinguished. The first two types are networks with constant arc weights. The other two types are networks with variable discrete weights. For the latter, methods for selecting workers for the work of the project (network) according to a given weight matrix are investigated. The problem of the first type is a classical network planning problem. For tasks of the second type, a criterion is given for the minimum required number of workers for an arbitrary network so that the execution time of the corresponding project is equal to the length of the critical path. The connection of tasks of the third type with the assignment problem is analyzed. For problems of the fourth type, an algorithm for assigning workers to jobs (i.e., assigning weights to arcs from a matrix of possible values) and a theorem on the minimum number of workers (in the case of renewable resources) to complete the project during the length of the critical path are given.

 

Download

References

1.Kremer N. Sh., Putko B. A., Trishin I. M., Friedman M.N. Issledovaniye operatsiy v ekonomike [The study of operations in the economy]. Moscow, JuNITI Publ., 2002. 407 p. (In Russian).

  1. Novitsky N. I. Setevoye planirovaniye i upravleniye proizvodstvom [Network planning and production management]. Moscow, Novoye znaniye Publ., 2004. 160 p. (In Russian). 3. Busnyuk N. N. Varieties of the network planning problem, some methods of their solution and algorithmic estimates. Trudy BGTU [Proceedings of BSTU], issue 3, Physies and Mathematics. Informatics, 2019, no. 2, pp. 101−104 (In Russian).
  2. Busnyuk N. N. Research of interdependence of cost and project duration in network tasks. Trudy BGTU [Proceedings of BSTU], issue 3, Physies and Mathematics. Informatics, 2020, no. 1, pp. 88−91 (In Russian).
  3. Busnyuk N. N., Сhernyak A. A. Matematicheskoye modelirovaniye [Mathematical modeling]. Minsk, Belarus’ Publ., 2014. 216 p. (In Russian).

 

Поступила после доработки 04.09.2023