A note on hierarchical scheduling on two uniform machines
From MaRDI portal
Publication:604878
DOI10.1007/S10878-008-9195-4zbMath1198.90210OpenAlexW2012919463MaRDI QIDQ604878
Publication date: 12 November 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9195-4
Related Items (19)
Total completion time minimization in online hierarchical scheduling of unit-size jobs ⋮ OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE AUGMENTATION ⋮ Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes ⋮ Total completion time minimization scheduling on two hierarchical uniform machines ⋮ Semi-online scheduling problems on two uniform machines under a grade of service provision ⋮ Online scheduling on uniform machines with two hierarchies ⋮ Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time ⋮ Online scheduling on two parallel identical machines under a grade of service provision ⋮ Online and semi-online hierarchical scheduling for load balancing on uniform machines ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Fast approximation algorithms for uniform machine scheduling with processing set restrictions ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies ⋮ On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints ⋮ Heuristics for online scheduling on identical parallel machines with two GoS levels ⋮ Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs ⋮ Online fractional hierarchical scheduling on uniformly related machines ⋮ On-line booking policies and competitive analysis of medical examination in hospital ⋮ Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
Cites Work
- Online and semi-online scheduling of two machines under a grade of service provision
- Preemptive scheduling on a small number of hierarchical machines
- The hierarchical model for load balancing on two machines
- Online scheduling on parallel machines with two goS levels
- On-line algorithms for the channel assignment problem in cellular networks.
- Tight bounds for bandwidth allocation on two links
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- On-Line Load Balancing in a Hierarchical Server Topology
- Randomized on-line scheduling on two uniform machines
This page was built for publication: A note on hierarchical scheduling on two uniform machines
