Preemptive machine covering on parallel machines

DOI10.1007/S10878-005-4923-5MaRDI QIDQ2583174zbMATH OpenOpenAlexFDO

Authors Yiwei Jiang, Zhiyi Tan, Yong He

Publication date 13 January 2006

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-005-4923-5

zbMATH Keywords

algorithm design and analysismachine coveringoff-lineon-lineparallel machine schedulingpreemption

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Optimal semi-online preemptive algorithms for machine covering on two uniform machines
• Parallel machine covering with limited number of preemptions
• On-line machine covering
• On-line machine covering
• SEMI-ONLINE MACHINE COVERING

Cites work

• A Level Algorithm for Preemptive Scheduling
• A lower bound for on-line scheduling on uniformly related machines
• A lower bound for randomized on-line multiprocessor scheduling
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• An optimal algorithm for preemptive on-line scheduling
• scientific article; zbMATH DE number 1182760 (Why is no real title available?)
• Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
• Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
• Optimal preemptive semi-online scheduling to minimize makespan on two related machines
• Ordinal on-line scheduling for maximizing the minimum machine completion time
• Preemptive on-line scheduling for two uniform processors
• Preemptive Scheduling of Uniform Processor Systems
• Randomized on-line scheduling on two uniform machines
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Scheduling uniform machines on-line requires nondecreasing speed ratios
• Semi-online scheduling with decreasing job sizes
• The exact LPT-bound for maximizing the minimum completion time
• The optimal on-line parallel machine scheduling

Cited in

(8)

• MapReduce machine covering problem on a small number of machines
• Preemptive semi-online algorithms for parallel machine scheduling with known total size
• OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES
• Parallel machine covering with limited number of preemptions
• Optimal semi-online preemptive algorithms for machine covering on two uniform machines
• On-line machine covering
• On-line machine covering
• Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines

This page was built for publication: Preemptive machine covering on parallel machines

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