Scheduling unit-time jobs on processors with different capabilities (Q1121780): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a scheduling problem where a job can be executed only by a limited number of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing mean weighted execution time loss on identical and uniform processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Tasks on Unrelated Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Preemptive Scheduling of Two Unrelated Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Bipartite Network Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow and Testing Graph Connectivity / rank
 
Normal rank

Latest revision as of 14:41, 19 June 2024

scientific article
Language Label Description Also known as
English
Scheduling unit-time jobs on processors with different capabilities
scientific article

    Statements

    Identifiers