Improved lower bounds for online scheduling to minimize total stretch (Q1680548): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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.1016/j.tcs.2017.09.032 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2763417498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bounds for Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On randomized online scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Flow Time Without Migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average stretch without migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for minimizing weighted flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for randomized on-line scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine / 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: Minimizing the stretch when scheduling flows of divisible requests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating total flow time on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling to Minimize Average Stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for the Online Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:18, 14 July 2024

scientific article
Language Label Description Also known as
English
Improved lower bounds for online scheduling to minimize total stretch
scientific article

    Statements

    Improved lower bounds for online scheduling to minimize total stretch (English)
    0 references
    0 references
    16 November 2017
    0 references
    scheduling problem
    0 references
    online problem
    0 references
    total stretch minimization
    0 references
    competitive analysis
    0 references

    Identifiers