Optimal preemptive semi-online scheduling on two uniform processors
From MaRDI portal
Publication:834944
DOI10.1016/j.ipl.2004.09.003zbMath1173.68404MaRDI QIDQ834944
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
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Semi-online preemptive scheduling: one algorithm for all variants, Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
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