The PERT Problem with Alternatives: Modelisation and Optimisation

Abstract : Management of projects often requires decisions concerning the choice of alternative activities. The completion time of the whole project (i.e. the makerpan) is computed subsequently. In this paper, we aim at selecting the activities and computing the makespan simultaneously. 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 introduced to represent either the choice between activities, or the fact that a set of activities should be completed before starting a subsequent set of activities. In this paper, we analyse the PPA and we propose a pseudo-polynomial algorithm to solve it.
Type de document :
[Research Report] RR-3651, INRIA. 1999, pp.27
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 11:37:14
Dernière modification le : samedi 17 septembre 2016 - 01:06:47
Document(s) archivé(s) le : jeudi 24 mars 2011 - 12:25:24



  • HAL Id : inria-00073021, version 1



Fabrice Chauvet, Jean-Marie Proth. The PERT Problem with Alternatives: Modelisation and Optimisation. [Research Report] RR-3651, INRIA. 1999, pp.27. 〈inria-00073021〉



Consultations de la notice


Téléchargements de fichiers