Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems (Q880502): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:49, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems |
scientific article |
Statements
Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems (English)
0 references
15 May 2007
0 references
multiprocessor scheduling
0 references
polynomial algorithms
0 references
high-multiplicity
0 references
