The most critical path in a PERT network: A heuristic approach (Q1341990)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The most critical path in a PERT network: A heuristic approach |
scientific article; zbMATH DE number 709897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The most critical path in a PERT network: A heuristic approach |
scientific article; zbMATH DE number 709897 |
Statements
The most critical path in a PERT network: A heuristic approach (English)
0 references
9 February 1995
0 references
project management
0 references
most critical path problem
0 references
deterministic network
0 references
two-attribute fractional objective function
0 references
heuristic
0 references
0 references
0.9267653822898864
0 references
0.8467534780502319
0 references
0.8142454028129578
0 references
0.8134229779243469
0 references
0.8008434772491455
0 references
