Parametric analysis of the quality of single preemption schedules on three uniform parallel machines

DOI10.1007/s10479-018-2952-6OpenAlexW2810233643MaRDI QIDQ829195

Vitaly A. Strusevich, Alan J. Soper

Publication date: 5 May 2021

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-018-2952-6

zbMATH Keywords

schedulinguniform parallel machinespower of preemption

Mathematics Subject Classification ID

Computer system organization (68Mxx) Discrete mathematics in relation to computer science (68Rxx) Operations research and management science (90Bxx)

Related Items (1)

Preemptive and non-preemptive scheduling on two unrelated parallel machines

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing makespan and preemption costs on a system of uniform machines
• On the geometry, preemptions and complexity of multiprocessor and shop scheduling
• The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
• A comment on scheduling on uniform machines under chain-type precedence constraints
• Algorithms with limited number of preemptions for scheduling on parallel machines
• Single parameter analysis of power of preemption on two and three uniform machines
• Scheduling with Deadlines and Loss Functions
• Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines
• Power of Preemption on Uniform Parallel Machines
• Bounds for LPT Schedules on Uniform Processors
• Preemptive Scheduling of Uniform Processor Systems
• A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
• Parallel Processor Scheduling with Limited Number of Preemptions
• Parallel Machine Scheduling: Impact of Adding Extra Machines
• The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders

This page was built for publication: Parametric analysis of the quality of single preemption schedules on three uniform parallel machines