Comment construire un graphe PERT minimal

DOI10.1051/RO/1981150100851MaRDI QIDQ3934123zbMATH OpenOpenAlexFDO

Authors F. Sterboul, D. Wertheimer

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

algorithmscomputational efficiencygraph construction algorithmminimal PERT graphproject scheduling

Mathematics Subject Classification ID

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

Cited in

(3)

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

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

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