Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (Q398903): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an 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.1007/s10951-013-0326-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044543491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor Scheduling with Rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive multiprocessor scheduling with rejection / 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: Bounds for List Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive online scheduling: Optimal algorithms for all speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online preemptive scheduling: one algorithm for all variants / 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: On-line uniform machine scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Level Algorithm for Preemptive Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217922 / 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: Preemptive on-line scheduling for two uniform processors / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:36, 8 July 2024

scientific article
Language Label Description Also known as
English
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
scientific article

    Statements

    Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (English)
    0 references
    0 references
    0 references
    18 August 2014
    0 references
    online scheduling
    0 references
    uniformly related machines
    0 references
    speed ratio
    0 references
    preemptive scheduling
    0 references

    Identifiers