Abstract
PERT (Program Evaluation Review Technique) [1] is a network that graphically represents the chronology of the project and allows to manage the project by breaking it down into separate tasks for evaluation and analysis of work execution terms.
Search for paper in
How to Cite
Markova , A., & Turchyna , V. (2023). TRANSFORMATION OF GRAPHS WHEN CALCULATING CHARACTERISTICS IN PERT NETWORKS. Collection of Scientific Papers «SCIENTIA», (January 20, 2023; Amsterdam, Netherlands), 122–123. Retrieved from https://previous.scientia.report/index.php/archive/article/view/684
This paper is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License
References
- Harvey M. Sapolsky. The Polaris System Development: Bureaucratic and Programmatic Success in Government. – 1972. – 261 p.
- Micha Sharir. A strong-connectivity algorithm and its applications in data flow analysis. Computers & Mathematics with Applications. – №7. – 1981. – P. 67-72.
- Robert E. Tarjan. Depth-first search and linear graph algorithms. – 1972. – P. 146-160.
- Edsger Dijkstra. A Discipline of Programming. Englewood Cliffs, NJ: Prentice Hall. – 1976. – 217 p.
Downloads
Download data is not yet available.