Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (Q1642847): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10100-017-0481-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2625359686 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q47555800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bounds for Online Scheduling / 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: Semi on-line scheduling on three processors with known sum of the tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling on two uniform processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric representation for semi on-line scheduling on uniform processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line bin-stretching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Load Balancing for Related Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase algorithm for bin stretching with stretching factor 1.5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bin stretching with three bins / 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: Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin stretching revisited / 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: Online bin stretching with bunch techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line algorithms for the partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling problems on a small number of machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two semi-online scheduling problems on two uniform machines / rank
 
Normal rank

Latest revision as of 22:12, 15 July 2024

scientific article
Language Label Description Also known as
English
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
scientific article

    Statements

    Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 June 2018
    0 references
    scheduling
    0 references
    semi-online algorithm
    0 references
    makespan minimization
    0 references
    mixed-integer linear programming
    0 references

    Identifiers