Online scheduling of equal-processing-time task systems (Q935146): 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.2008.03.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992739773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling for two-processor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Online Scheduling of Precedence Constrained Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst Case Analysis of Two Scheduling Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Preemptive Scheduling on Two-Processor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:06, 28 June 2024

scientific article
Language Label Description Also known as
English
Online scheduling of equal-processing-time task systems
scientific article

    Statements

    Online scheduling of equal-processing-time task systems (English)
    0 references
    0 references
    0 references
    0 references
    31 July 2008
    0 references
    0 references
    online scheduling
    0 references
    intree precedence constraints
    0 references
    equal-processing-time tasks
    0 references
    competitive ratio
    0 references
    parallel and identical machines
    0 references
    makespan
    0 references
    0 references