The complexity of a multiprocessor task assignment problem without deadlines (Q1155958): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:33, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of a multiprocessor task assignment problem without deadlines |
scientific article |
Statements
The complexity of a multiprocessor task assignment problem without deadlines (English)
0 references
1982
0 references
