Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length (Q3826356)

From MaRDI portal
Revision as of 17:20, 19 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
Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
scientific article

    Statements

    Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    multiprocessor scheduling
    0 references
    nonpreemptive scheduling
    0 references
    n tasks
    0 references
    tree- structured precedence relation
    0 references
    minimum length schedule
    0 references
    two identical processors
    0 references