Performance of critical path type algorithms for scheduling on parallel processors (Q5949904): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Optimal scheduling for two-processor systems / 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: The Complexity of Scheduling Trees with Communication Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Task Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: UET scheduling with unit interprocessor communication delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546239 / 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 21:35, 3 June 2024

scientific article; zbMATH DE number 1678857
Language Label Description Also known as
English
Performance of critical path type algorithms for scheduling on parallel processors
scientific article; zbMATH DE number 1678857

    Statements