Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (Q1013298): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2008.09.001 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2008.09.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986491739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3949970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling for two-processor systems / 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: Scheduling Flat Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling precedence graphs of bounded height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Opposing Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling on parallel machines for a new order class / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2008.09.001 / rank
 
Normal rank

Latest revision as of 12:49, 10 December 2024

scientific article
Language Label Description Also known as
English
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
scientific article

    Statements

    Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (English)
    0 references
    0 references
    0 references
    0 references
    17 April 2009
    0 references
    complexity
    0 references
    divide-and-conquer graph
    0 references
    HLF
    0 references
    identical parallel processors
    0 references
    makespan
    0 references

    Identifiers