Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520): 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/s00453-008-9235-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2594258165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On randomized online scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Load Balancing for Related Machines / 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: An optimal algorithm for preemptive on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and online preemptive scheduling on uniformly related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios / 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: A lower bound for on-line scheduling on uniformly related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Uniform Processor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Level Algorithm for Preemptive Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for randomized on-line multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized on-line scheduling on three processors. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive on-line scheduling for two uniform processors / rank
 
Normal rank

Latest revision as of 13:43, 1 July 2024

scientific article
Language Label Description Also known as
English
Preemptive online scheduling: Optimal algorithms for all speeds
scientific article

    Statements

    Preemptive online scheduling: Optimal algorithms for all speeds (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 May 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    online algorithms
    0 references
    scheduling
    0 references
    makespan
    0 references
    0 references