Preemptive machine covering on parallel machines (Q2583174): 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.1007/s10878-005-4923-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091746344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400843 / 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: The exact LPT-bound for maximizing the minimum completion time / 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: Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios / 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: 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: Preemptive Scheduling of Uniform Processor Systems / 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: Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines / 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: A Level Algorithm for Preemptive Scheduling / 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: A lower bound for randomized on-line multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling uniform machines on-line requires nondecreasing speed ratios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive on-line scheduling for two uniform processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for maximizing the minimum machine completion time / rank
 
Normal rank

Latest revision as of 14:13, 11 June 2024

scientific article
Language Label Description Also known as
English
Preemptive machine covering on parallel machines
scientific article

    Statements

    Preemptive machine covering on parallel machines (English)
    0 references
    0 references
    0 references
    0 references
    13 January 2006
    0 references
    machine covering
    0 references
    parallel machine scheduling
    0 references
    preemption
    0 references
    algorithm design and analysis
    0 references
    off-line
    0 references
    on-line
    0 references

    Identifiers