On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications (Q3148374): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:09, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications |
scientific article |
Statements
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications (English)
0 references
30 September 2002
0 references
scheduling
0 references
hierarchical communications
0 references
non-approximability
0 references
