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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q126297485, #quickstatements; #temporary_batch_1718130780407
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: 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
Property / Wikidata QID
 
Property / Wikidata QID: Q126297485 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:35, 11 June 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
    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
    0 references