Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines (Q2957687): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Vitaly A. Strusevich / rank
Normal rank
 
Property / author
 
Property / author: Vitaly A. Strusevich / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / 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: Preemptive Scheduling of Uniform Processor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Minimizing Average Flow Time with Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms with limited number of preemptions for scheduling on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling: Impact of Adding Extra Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Unrelated Machines by Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of Average Completion Time Scheduling on Unrelated Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single parameter analysis of power of preemption on two and three uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power of Preemption on Uniform Parallel 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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/16m1066610 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2569786510 / rank
 
Normal rank

Latest revision as of 09:57, 30 July 2024

scientific article
Language Label Description Also known as
English
Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines
scientific article

    Statements

    Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 January 2017
    0 references
    scheduling
    0 references
    total completion time
    0 references
    power of preemption
    0 references
    uniformly related machines
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references