Parallel machine covering with limited number of preemptions

DOI10.1007/s11766-014-3138-xzbMath1313.90088OpenAlexW2057275636MaRDI QIDQ462268

Yiwei Jiang, Yuqing Zhu, Jueliang Hu, Zewei Weng

Publication date: 3 November 2014

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-014-3138-x

zbMATH Keywords

approximation algorithmpreemptive schedulingmachine coveringworst case ratio

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• The exact LPT-bound for maximizing the minimum completion time
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• A comment on scheduling on uniform machines under chain-type precedence constraints
• The maximum gain of increasing the number of preemptions in multiprocessor scheduling
• Tight bounds for bandwidth allocation on two links
• Preemptive machine covering on parallel machines
• Scheduling with Deadlines and Loss Functions
• Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• A Level Algorithm for Preemptive Scheduling
• Preemptive Scheduling of Uniform Processor Systems
• Parallel Processor Scheduling with Limited Number of Preemptions
• Bounds on Multiprocessing Timing Anomalies
• The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
• Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios

This page was built for publication: Parallel machine covering with limited number of preemptions