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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Scheduling subject to resource constraints: Classification and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling for two-processor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling precedence graphs of bounded height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Profile Scheduling of Opposing Forests and Level Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost-Linear Algorithm for Two-Processor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Opposing Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3899811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer-Aided complexity classification of combinational problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete scheduling problems / rank
 
Normal rank

Revision as of 12:21, 20 June 2024

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