An efficient algorithm for semi-online multiprocessor scheduling with given total processing time (Q906558): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recent Advances for a Classical Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The on-line multiprocessor scheduling problem with known sum of the tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line bin-stretching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Algorithms for Online Bin Stretching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-on-line multiprocessor scheduling with given total processing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3031924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for bin stretching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line algorithms for the partition problem / rank
 
Normal rank

Latest revision as of 09:22, 11 July 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
scientific article

    Statements

    An efficient algorithm for semi-online multiprocessor scheduling with given total processing time (English)
    0 references
    0 references
    0 references
    0 references
    22 January 2016
    0 references
    semi-online scheduling
    0 references
    competitive analysis
    0 references
    multiprocessor scheduling
    0 references

    Identifiers