Determining the <i>K</i> Most Critical Paths in PERT Networks (Q3337928): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.32.4.859 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2118170736 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:55, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determining the <i>K</i> Most Critical Paths in PERT Networks |
scientific article |
Statements
Determining the <i>K</i> Most Critical Paths in PERT Networks (English)
0 references
1984
0 references
project planning
0 references
PERT networks
0 references
most critical path
0 references
stochastic dominance to
0 references
