Scheduling unit-length jobs with precedence constraints of small height (Q1667212): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a parallel machine scheduling problem with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling / 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: Scheduling Flat Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing of Two Equivalent Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time recognition algorithm for interval dags / 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: Scheduling Interval-Ordered Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3152807 / rank
 
Normal rank

Latest revision as of 11:10, 16 July 2024

scientific article
Language Label Description Also known as
English
Scheduling unit-length jobs with precedence constraints of small height
scientific article

    Statements

    Scheduling unit-length jobs with precedence constraints of small height (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 August 2018
    0 references
    scheduling
    0 references
    precedence constraints
    0 references
    computational complexity
    0 references
    polynomial-time algorithms
    0 references

    Identifiers

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