Algorithms for Scheduling Tasks on Unrelated Processors (Q3925878)

From MaRDI portal
Revision as of 18:21, 4 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128252770, #quickstatements; #temporary_batch_1722788207324)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Algorithms for Scheduling Tasks on Unrelated Processors
scientific article

    Statements

    Algorithms for Scheduling Tasks on Unrelated Processors (English)
    0 references
    0 references
    0 references
    1981
    0 references
    nonpreemptive schedules
    0 references
    worst case finishing time
    0 references
    performance ratio
    0 references
    largest processing time
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references