The PERT Problem with Alternatives: Modelisation and Optimisation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1999

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.
Fichier principal
Vignette du fichier
RR-3651.pdf (1.35 Mo) Télécharger le fichier

Dates and versions

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

Identifiers

  • HAL Id : inria-00073021 , version 1

Cite

Fabrice Chauvet, Jean-Marie Proth. The PERT Problem with Alternatives: Modelisation and Optimisation. [Research Report] RR-3651, INRIA. 1999, pp.27. ⟨inria-00073021⟩
90 View
35 Download

Share

Gmail Facebook Twitter LinkedIn More