Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10114-005-0829-5 / rank
Normal rank
 
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.1007/s10114-005-0829-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969445568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line machine covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact LPT-bound for maximizing the minimum completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal on-line parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal on-line scheduling for maximizing the minimum machine completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3626419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling with decreasing job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal preemptive semi-online scheduling to minimize makespan on two related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive semi-online algorithms for parallel machine scheduling with known total size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for maximizing the minimum machine completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive machine covering on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Uniform Processor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Level Algorithm for Preemptive Scheduling / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10114-005-0829-5 / rank
 
Normal rank

Latest revision as of 05:41, 10 December 2024

scientific article
Language Label Description Also known as
English
Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
scientific article

    Statements

    Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (English)
    0 references
    0 references
    0 references
    0 references
    13 December 2006
    0 references
    semi-online
    0 references
    preemptive scheduling
    0 references
    uniform machines
    0 references
    competitive ratio
    0 references

    Identifiers