Two-point approximations for activity times in PERT networks

DOI10.1051/RO/1985190303011zbMath0574.90044OpenAlexW2298804757MaRDI QIDQ3693242

Jerzy Kamburowski

Publication date: 1985

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

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

zbMATH Keywords

upper boundsapproximationsPERT networksconvex majorizationrandom activity durationsexpected completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Risk taking in stochastic PERT networks

This page was built for publication: Two-point approximations for activity times in PERT networks