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

DOI10.1051/RO/1985190100271zbMATH Open0568.90048OpenAlexW2515357851MaRDI QIDQ3686480FDOQ3686480

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

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

zbMATH Keywords

boundsstochastic schedulingapproximative methodmaximum of random variablesexpected total durationprobabilistic PERT scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (4)

• Introduction de dates échues dans l'analyse PERT-coût
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)