Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling (Q491212): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-009-9265-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011250895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-on-line scheduling on two parallel processors with an upper bound on the items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387663 / 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: On-line bin-stretching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for List Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online algorithms for parallel machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin stretching revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized on-line scheduling on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line scheduling on two identical machines / 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: Two semi-online scheduling problems on two uniform machines / rank
 
Normal rank

Latest revision as of 17:05, 10 July 2024

scientific article
Language Label Description Also known as
English
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
scientific article

    Statements

    Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling (English)
    0 references
    0 references
    0 references
    0 references
    24 August 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    semi-online scheduling
    0 references
    uniform machines
    0 references
    competitive analysis
    0 references
    0 references