Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
From MaRDI portal
DOI10.1007/s10878-013-9627-7zbMath1320.90039OpenAlexW2089029354MaRDI QIDQ2343998
Yiwei Jiang, Jueliang Hu, An Zhang, Lidan Fan
Publication date: 11 May 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9627-7
Related Items
Total completion time minimization in online hierarchical scheduling of unit-size jobs, Semi-online scheduling: a survey, Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements, Bin stretching with migration on two hierarchical machines, Online early work maximization problem on two hierarchical machines with buffer or rearrangements, Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing, Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1, On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints, Online scheduling with migration on two hierarchical machines
Cites Work
- A note on hierarchical scheduling on two uniform machines
- Online hierarchical scheduling: an approach using mathematical programming
- Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
- Online parallel machines scheduling with two hierarchies
- 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
- Semi on-line scheduling on two identical machines
- On-line algorithms for the channel assignment problem in cellular networks.
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- On-Line Load Balancing in a Hierarchical Server Topology
