Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems (Q880502)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems |
scientific article; zbMATH DE number 5153335
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems |
scientific article; zbMATH DE number 5153335 |
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
