Algorithms with limited number of preemptions for scheduling on parallel machines (Q2015808): 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.1007/s10878-012-9545-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2294497340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Processor Scheduling with Limited Number of Preemptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and online preemptive 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: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Level Algorithm for Preemptive Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results on Liu’s Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum gain of increasing the number of preemptions in multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan and preemption costs on a system of uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comment on scheduling on uniform machines under chain-type precedence constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:44, 8 July 2024

scientific article
Language Label Description Also known as
English
Algorithms with limited number of preemptions for scheduling on parallel machines
scientific article

    Statements

    Algorithms with limited number of preemptions for scheduling on parallel machines (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2014
    0 references
    \(i\)-preemptive scheduling
    0 references
    approximation algorithm
    0 references
    worst case ratio
    0 references
    makespan
    0 references

    Identifiers