Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A Simple Approximation to the Completion Time Distribution for a PERT Network

From MaRDI portal
Publication:3984312
Jump to:navigation, search

DOI10.1057/jors.1991.191zbMath0735.90037OpenAlexW2049554266MaRDI QIDQ3984312

J. Keith Ord

Publication date: 27 June 1992

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1991.191


zbMATH Keywords

discrete approximationsheuristic methodPERT analysis


Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)


Related Items (2)

Longest path analysis in networks of queues: dynamic scheduling problems ⋮ Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty




This page was built for publication: A Simple Approximation to the Completion Time Distribution for a PERT Network

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3984312&oldid=12036444"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 00:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki