On PERT Networks with Alternatives

Abstract : 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.
Type de document :
[Research Report] RR-3583, INRIA. 1998, pp.21
Liste complète des métadonnées

Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 11:51:36
Dernière modification le : samedi 17 septembre 2016 - 01:06:50
Document(s) archivé(s) le : jeudi 24 mars 2011 - 12:29:15



  • 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〉



Consultations de la notice


Téléchargements de fichiers