The computational complexity of the criticality problems in a network with interval activity times (Q5953342): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:06, 30 January 2024
scientific article; zbMATH DE number 1694119
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
