Online scheduling of parallel jobs on two machines is 2-competitive (Q924886): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.orl.2007.06.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119760147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of parallel jobs on two machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling parallel jobs to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Information and Communication Complexity / rank
 
Normal rank

Latest revision as of 10:02, 28 June 2024

scientific article
Language Label Description Also known as
English
Online scheduling of parallel jobs on two machines is 2-competitive
scientific article

    Statements

    Online scheduling of parallel jobs on two machines is 2-competitive (English)
    0 references
    29 May 2008
    0 references
    online scheduling
    0 references
    parallel jobs
    0 references
    competitive analysis
    0 references
    0 references
    0 references

    Identifiers