Scheduling imprecise computation tasks on uniform processors (Q2379995): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3680271 / 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: Real-time scheduling algorithm for minimizing maximum weighted error with \(O(N \log N+cN)\) complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Maximum Weighted Error for Imprecise Computation Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the weighted number of tardy task units / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling to Minimize Total Late Work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling on uniform parallel machines with controllable job processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Imprecise Computations with Timing Constraints / rank
 
Normal rank

Revision as of 14:24, 2 July 2024

scientific article
Language Label Description Also known as
English
Scheduling imprecise computation tasks on uniform processors
scientific article

    Statements

    Scheduling imprecise computation tasks on uniform processors (English)
    0 references
    0 references
    0 references
    0 references
    24 March 2010
    0 references
    preemptive scheduling
    0 references
    uniform processors
    0 references
    imprecise computation task
    0 references
    polynomial time algorithms
    0 references
    algorithms
    0 references
    analysis of algorithms
    0 references
    combinatorial problems
    0 references

    Identifiers