Note sur les problèmes d'ordonnancement PERT aléatoires

DOI10.1051/RO/1985190100271MaRDI QIDQ3686480zbMATH OpenOpenAlexFDO

Authors Philippe Laloyaux, Claude Lefèvre

Publication date 1985

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/104868

zbMATH Keywords

boundsstochastic schedulingapproximative methodmaximum of random variablesexpected total durationprobabilistic PERT scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Bounding the distribution of project duration in PERT networks
• Stochastisches PERT — Eine vergleichende Untersuchung über die Effizienz eines Verfahrens zur stochastischen Projektplanung
• scientific article; zbMATH DE number 3916004
• Computing bounds on project duration distributions for stochastic PERT networks
• An upper bound on the expected completion time of PERT networks

Cited in

(4)

• Introduction de dates échues dans l'analyse PERT-coût
• scientific article; zbMATH DE number 1775053 (Why is no real title available?)
• scientific article; zbMATH DE number 3170445 (Why is no real title available?)
• scientific article; zbMATH DE number 3312376 (Why is no real title available?)

This page was built for publication: Note sur les problèmes d'ordonnancement PERT aléatoires

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686480)