Optimal scheduling on parallel machines for a new order class (Q1306374): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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: Optimal Sequencing of Two Equivalent Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / 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: The Recognition of Series Parallel Digraphs / rank
 
Normal rank

Revision as of 08:29, 29 May 2024

scientific article
Language Label Description Also known as
English
Optimal scheduling on parallel machines for a new order class
scientific article

    Statements

    Optimal scheduling on parallel machines for a new order class (English)
    0 references
    0 references
    1999
    0 references
    nonpreemptive scheduling
    0 references
    parallel machines
    0 references
    list scheduling algorithms
    0 references
    precedence graphs
    0 references
    interval orders
    0 references
    series parallel orders
    0 references
    linear time algorithm
    0 references

    Identifiers