Comment construire un graphe PERT minimal

DOI10.1051/ro/1981150100851zbMath0477.90028OpenAlexW4253844415MaRDI QIDQ3934123

D. Wertheimer, F. Sterboul

Publication date: 1981

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

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

zbMATH Keywords

algorithmsproject schedulingcomputational efficiencygraph construction algorithmminimal PERT graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Activity nets: A guided tour through some recent developments ⋮ The exact overall time distribution of a project with uncertain task durations ⋮ A distributionally robust analysis of the program evaluation and review technique

This page was built for publication: Comment construire un graphe PERT minimal