Scheduling Opposing Forests (Q4745255): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: David S. Johnson / rank
Normal rank
 
Property / author
 
Property / author: Robert Endre Tarjan / rank
Normal rank
 
Property / author
 
Property / author: David S. Johnson / rank
 
Normal rank
Property / author
 
Property / author: Robert Endre Tarjan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/0604011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018342998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling for two-processor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing of Two Equivalent Processors / 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: Complexity Results for Multiprocessor Scheduling under Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Tasks with Nonuniform Deadlines on Two Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Processor Scheduling with Start-Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Series-Parallel Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Interval-Ordered Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Graphs on Two Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete scheduling problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:22, 13 June 2024

scientific article; zbMATH DE number 3800922
Language Label Description Also known as
English
Scheduling Opposing Forests
scientific article; zbMATH DE number 3800922

    Statements

    Scheduling Opposing Forests (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1983
    0 references
    unit-time tasks
    0 references
    precedence constraints
    0 references
    common deadline
    0 references
    NP-complete
    0 references

    Identifiers

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