Optimal preemptive semi-online scheduling on two uniform processors

DOI10.1016/J.IPL.2004.09.003MaRDI QIDQ834944zbMATH OpenOpenAlexFDO

Authors Donglei Du

Publication date 27 August 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2004.09.003

zbMATH Keywords

preemptionschedulingon-line algorithmsuniform processor

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
• Semi-online scheduling on two uniform processors
• Preemptive on-line scheduling for two uniform processors
• Optimal preemptive online scheduling to minimize \(l_p\) norm on two processors
• OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES
• Optimal semi-online algorithm for scheduling on two parallel batch processing machines
• Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
• Optimal non-preemptive semi-online scheduling on two related machines
• scientific article; zbMATH DE number 1929942
• Preemptive stochastic online scheduling on two uniform machines

Cites work

• scientific article; zbMATH DE number 1929942 (Why is no real title available?)
• Optimal preemptive semi-online scheduling to minimize makespan on two related machines
• Ordinal algorithms for parallel machine scheduling
• Preemptive Scheduling of Uniform Processor Systems
• Preemptive on-line scheduling for two uniform processors
• Randomized on-line scheduling on two uniform machines
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• Semi-on-line scheduling on two parallel processors with an upper bound on the items
• Semi-online scheduling with decreasing job sizes

Cited in

(21)

• Semi-online scheduling with decreasing job sizes
• Semi-online preemptive scheduling: one algorithm for all variants
• Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
• Geometric representation for semi on-line scheduling on uniform processors
• Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
• On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines
• Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
• Preemptive on-line scheduling for two uniform processors
• Semi-online preemptive scheduling: one algorithm for all variants
• Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
• Optimal preemptive semi-online scheduling to minimize makespan on two related machines
• Semi-online preemptive scheduling: study of special cases
• Semi-online scheduling on two uniform processors
• Semi-online scheduling with bounded job sizes on two uniform machines
• Algorithms and Computation
• OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES
• Online hierarchical scheduling on two uniform machines with bounded job sizes
• Optimal non-preemptive semi-online scheduling on two related machines
• scientific article; zbMATH DE number 1929942 (Why is no real title available?)
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
• Semi-online scheduling: a survey

This page was built for publication: Optimal preemptive semi-online scheduling on two uniform processors

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