- Citado por SciELO
Gestão & Produção
versión impresa ISSN 0104-530X
versión On-line ISSN 1806-9649
CONTADOR, José Luiz y SENNE, Edson Luiz França. DetermInation of K most critical paths in PERT networks. Gest. Prod. [online]. 2007, vol.14, n.3, pp.463-476. ISSN 0104-530X. http://dx.doi.org/10.1590/S0104-530X2007000300004.
This paper presents a study about the most important methods to determine the K most critical paths in PERT networks. When k = 1, it means the longest path, traditionally known as the critical path; when k = 2, it means the second longest path, and so on. Three algorithms available in the literature are discussed, and a new algorithm, known as minimum slack algorithm and which presents some advantages over the others, is proposed. The performance of the minimum slack algorithm when applied to PERT networks is evaluated using a simulation process.
Palabras clave : Project management; CPM/PERT; K most critical paths.