Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
From MaRDI portal
Publication:5949924
DOI10.1016/S0167-6377(01)00085-2zbMath0981.90024OpenAlexW2071788993WikidataQ127358836 ScholiaQ127358836MaRDI QIDQ5949924
Publication date: 5 December 2001
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(01)00085-2
Related Items
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines ⋮ Parallel solutions for preemptive makespan scheduling on two identical machines ⋮ Parallel machine covering with limited number of preemptions ⋮ Preemptive scheduling on a small number of hierarchical machines ⋮ Optimal on-line algorithms to minimize makespan on two machines with resource augmentation ⋮ Robust algorithms for preemptive scheduling ⋮ Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information ⋮ Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms ⋮ Preemptive online scheduling: Optimal algorithms for all speeds ⋮ Optimal and online preemptive scheduling on uniformly related machines ⋮ Preemptive machine covering on parallel machines ⋮ Optimal preemptive semi-online scheduling to minimize makespan on two related machines
Cites Work
- A lower bound for randomized on-line multiprocessor scheduling
- New algorithms for an ancient scheduling problem.
- Online algorithms. The state of the art
- Scheduling uniform machines on-line requires nondecreasing speed ratios
- Preemptive on-line scheduling for two uniform processors
- A lower bound for randomized on-line scheduling algorithms
- An optimal algorithm for preemptive on-line scheduling
- A lower bound for on-line scheduling on uniformly related machines
- A comment on scheduling on uniform machines under chain-type precedence constraints
- A Level Algorithm for Preemptive Scheduling
- Preemptive Scheduling of Uniform Processor Systems
- On-Line Load Balancing for Related Machines
- Randomized on-line scheduling on two uniform machines
