Critical path: различия между версиями

Материал из WikiGrapp
Перейти к навигации Перейти к поиску
(Новая страница: «'''Critical path''' --- критический путь. An important parameter in any ''PERT'' digraph is the length of the longest path from the start to the ter…»)
(нет различий)

Версия от 15:33, 15 марта 2011

Critical path --- критический путь.

An important parameter in any PERT digraph is the length of the longest path from the start to the termination vertex. Such a path is called a critical path, and its length represents the shortest time within which the overall task can be completed. For this reason the analysis is sometimes called CPM (Critical path method).