Lefèvre, Claude; Laloyaux, Philippe Note sur les problèmes d’ordonnancement PERT aléatoires. (French) Zbl 0568.90048 RAIRO, Rech. Opér. 19, 27-33 (1985). The purpose of this note is twofold. We first present a brief survey of the different approaches developed in the literature to study the probabilistic PERT scheduling problems. This allows us, in particular, to situate clearly the recent approximative method of J. P. Melin [ibid. 17, 175-191 (1983; Zbl 0519.90045)] among the other methods proposed. We then construct bounds for the expected total duration of the project. These bounds can be easily computed and depend only on the means and the variances of the durations of the activities composing the project. MSC: 90B35 Deterministic scheduling theory in operations research Keywords:stochastic scheduling; maximum of random variables; probabilistic PERT scheduling; approximative method; bounds; expected total duration Citations:Zbl 0519.90045 PDFBibTeX XMLCite \textit{C. Lefèvre} and \textit{P. Laloyaux}, RAIRO, Rech. Opér. 19, 27--33 (1985; Zbl 0568.90048) Full Text: DOI EuDML