Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints (Q3468873)

From MaRDI portal
Revision as of 01:18, 7 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
scientific article

    Statements

    Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints (English)
    0 references
    1989
    0 references
    tree-like precedence constraints
    0 references
    two processor scheduling
    0 references
    schedules for trees
    0 references
    worst-case absolute error
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references