ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO (Q5462125): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the competitiveness of on-line real-time task scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with partial job values: does timesharing or randomization help? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling in overloaded systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems / rank
 
Normal rank

Latest revision as of 14:29, 10 June 2024

scientific article; zbMATH DE number 2190074
Language Label Description Also known as
English
ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO
scientific article; zbMATH DE number 2190074

    Statements

    ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO (English)
    0 references
    0 references
    0 references
    0 references
    1 August 2005
    0 references
    0 references
    Online scheduling
    0 references
    competitive analysis
    0 references
    importance ratio
    0 references
    quality of service
    0 references