Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems (Q880502)

From MaRDI portal
Revision as of 18:08, 25 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    15 May 2007
    0 references
    multiprocessor scheduling
    0 references
    polynomial algorithms
    0 references
    high-multiplicity
    0 references

    Identifiers