Tighter bound for MULTIFIT scheduling on uniform processors (Q1175792): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Independent Tasks on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds for the Multifit Processor Scheduling Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Multifit Scheduling on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact upper bound for the Multifit processor scheduling algorithm / rank
 
Normal rank

Latest revision as of 11:20, 15 May 2024

scientific article
Language Label Description Also known as
English
Tighter bound for MULTIFIT scheduling on uniform processors
scientific article

    Statements

    Tighter bound for MULTIFIT scheduling on uniform processors (English)
    0 references
    0 references
    25 June 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    heuristic algorithms
    0 references
    uniform-processor
    0 references
    bin packing
    0 references
    multiprocessor scheduling
    0 references
    worst-case analysis
    0 references