On PERT Networks with Alternatives - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1998

On PERT Networks with Alternatives


Management of projects often requires decisions concerning the choice of alternative activities. Then, the completion time of the whole project (i.e. the makerpan) is computed. In this paper, we aim at selecting the required activities simultaneously with the computation of the makespan. This problem is referred to as PERT Problem with Alternatives (PPA). The corresponding model is similar to a conventional PERT graph, except that two types of nodes are involved to represent either the choice between activities, or the fact that a set of activities should be completed before starting another set of activities. A formalization of the problem and some important properties concerning the optimal solution are given. Several well- solvable cases of the problem and a powerful decomposition algorithm running in polynomial time are presented. This decomposition is applicable for solving many real-life problems.
Fichier principal
Vignette du fichier
RR-3583.pdf (1014.84 Ko) Télécharger le fichier

Dates and versions

inria-00073098 , version 1 (24-05-2006)


  • HAL Id : inria-00073098 , version 1


Fabrice Chauvet, Eugene Levner, Jean-Marie Proth. On PERT Networks with Alternatives. [Research Report] RR-3583, INRIA. 1998, pp.21. ⟨inria-00073098⟩
90 View
29 Download


Gmail Facebook X LinkedIn More