New heuristics for modeling temporal constraints and generating PERT network with minimum number of dummy-arcs (Q5223871)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7082579
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New heuristics for modeling temporal constraints and generating PERT network with minimum number of dummy-arcs |
scientific article; zbMATH DE number 7082579 |
Statements
18 July 2019
0 references
minimal AoA network
0 references
PERT graph
0 references
project scheduling problem
0 references
temporal constraints
0 references
0.8620378971099854
0 references
0.8132419586181641
0 references
0.7836527228355408
0 references
0.7820947170257568
0 references
