The expected asymptotical ratio for preemptive stochastic online problem (Q391147): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B36 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6244038 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
online algorithm
Property / zbMATH Keywords: online algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
asymptotical optimality
Property / zbMATH Keywords: asymptotical optimality / rank
 
Normal rank
Property / zbMATH Keywords
 
uniform machines
Property / zbMATH Keywords: uniform machines / rank
 
Normal rank

Revision as of 15:08, 29 June 2023

scientific article
Language Label Description Also known as
English
The expected asymptotical ratio for preemptive stochastic online problem
scientific article

    Statements

    The expected asymptotical ratio for preemptive stochastic online problem (English)
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    0 references
    scheduling
    0 references
    online algorithm
    0 references
    asymptotical optimality
    0 references
    uniform machines
    0 references