A polynomial algorithm for some preemptive multiprocessor task scheduling problems (Q2432888): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62048705, #quickstatements; #temporary_batch_1711094041063
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal Linear Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4859840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks for mean flow time criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of scheduling multiprocessor tasks with prespecified processors allocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708601 / rank
 
Normal rank

Latest revision as of 22:15, 24 June 2024

scientific article
Language Label Description Also known as
English
A polynomial algorithm for some preemptive multiprocessor task scheduling problems
scientific article

    Statements

    A polynomial algorithm for some preemptive multiprocessor task scheduling problems (English)
    0 references
    0 references
    0 references
    25 October 2006
    0 references
    0 references
    scheduling
    0 references
    complexity theory
    0 references
    multiprocessor tasks
    0 references
    dedicated processors
    0 references
    0 references
    0 references