Optimal preemptive semi-online scheduling on two uniform processors

DOI10.1016/j.ipl.2004.09.003zbMath1173.68404OpenAlexW2002707982MaRDI QIDQ834944

Dong-lei 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

schedulingon-line algorithmspreemptionuniform processor

Mathematics Subject Classification ID

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

Related Items (6)

Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes ⋮ Semi-online scheduling with bounded job sizes on two uniform machines ⋮ Semi-online scheduling: a survey ⋮ Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms ⋮ Semi-online preemptive scheduling: one algorithm for all variants ⋮ On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines

Cites Work

• Unnamed Item
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• Preemptive on-line scheduling for two uniform processors
• Semi-on-line scheduling on two parallel processors with an upper bound on the items
• Optimal preemptive semi-online scheduling to minimize makespan on two related machines
• Ordinal algorithms for parallel machine scheduling
• Preemptive Scheduling of Uniform Processor Systems
• Semi-online scheduling with decreasing job sizes
• Randomized on-line scheduling on two uniform machines

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