Semi-online scheduling revisited (Q442235): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.2012.03.031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063410603 / 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: 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 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: New algorithms for an ancient scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better lower bound for on-line scheduling / 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: Semi-on-line multiprocessor scheduling with given total processing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Reordering for Online Minimum Makespan Scheduling / 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: An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Better Algorithm for an Ancient Scheduling Problem / 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: Improved Bounds for the Online Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for randomized on-line multiprocessor scheduling / rank
 
Normal rank

Latest revision as of 13:44, 5 July 2024

scientific article
Language Label Description Also known as
English
Semi-online scheduling revisited
scientific article

    Statements

    Semi-online scheduling revisited (English)
    0 references
    0 references
    0 references
    10 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    competitive analysis
    0 references
    makespan minimization
    0 references
    online computation
    0 references
    0 references