The computational complexity of the criticality problems in a network with interval activity times (Q5953342)
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 1694119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of the criticality problems in a network with interval activity times |
scientific article; zbMATH DE number 1694119 |
Statements
The computational complexity of the criticality problems in a network with interval activity times (English)
0 references
23 January 2002
0 references
project management and scheduling
0 references
complexity theory
0 references
interval criticality
0 references
interval CPM
0 references
0 references
0.8977534
0 references
0.8814312
0 references
0.8701153
0 references
0.8692975
0 references
0.8578063
0 references
0.85589474
0 references
