Parallel machine covering with limited number of preemptions

DOI10.1007/S11766-014-3138-XzbMATH Open1313.90088OpenAlexW2057275636MaRDI QIDQ462268FDOQ462268

Authors: Yiwei Jiang, Jueliang Hu, Zewei Weng, Yuqing Zhu 

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

Recommendations

• Preemptive machine covering on parallel machines
• Algorithms with limited number of preemptions for scheduling on parallel machines
• Algorithms with limited number of preemptions for scheduling on parallel machines
• A combination of parallel machine scheduling and the covering problem
• On the complexity of scheduling unrelated parallel machines with limited preemptions
• Combination of parallel machine scheduling and vertex cover
• scientific article; zbMATH DE number 1187165
• Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
• Optimal preemptive scheduling on a fixed number of identical parallel machines
• Power of preemption for minimizing total completion time on uniform parallel machines

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

• Bounds on Multiprocessing Timing Anomalies
• Scheduling with deadlines and loss functions
• Preemptive Scheduling of Uniform Processor Systems
• The exact LPT-bound for maximizing the minimum completion time
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Title not available (Why is that?)
• A Level Algorithm for Preemptive Scheduling
• Parallel Processor Scheduling with Limited Number of Preemptions
• Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
• 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
• Algorithms with limited number of preemptions for scheduling on parallel machines
• The power of preemption on unrelated machines and applications to scheduling orders

Cited In (3)

• Algorithms with limited number of preemptions for scheduling on parallel machines
• Parallel Processor Scheduling with Limited Number of Preemptions
• Preemptive machine covering on parallel machines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q462268)