Semi-online hierarchical load balancing problem with bounded processing times
From MaRDI portal
Publication:897964
Recommendations
- Semi-online hierarchical load balancing problem with bounded processing times
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
- Semi-online early work maximization problem on two hierarchical machines with partial information of processing time
Cites work
- Online and semi-online hierarchical scheduling for load balancing on uniform machines
- Online and semi-online scheduling of two machines under a grade of service provision
- Optimal algorithms for semi-online machine covering on two hierarchical machines
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Parallel machine scheduling under a grade of service provision
- Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
- Semi-online scheduling with two GoS levels and unit processing time
- The hierarchical model for load balancing on two machines
Cited in
(12)- Semi-online multiprocessor scheduling with bounded jobs
- Online scheduling with migration on two hierarchical machines
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
- Semi-online hierarchical load balancing problem with bounded processing times
- Bin stretching with migration on two hierarchical machines
- The hierarchical model for load balancing on two machines
- Semi-online scheduling: a survey
- Semi-online machine covering on two hierarchical machines with known total size of low-hierarchy jobs
- A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
- Online early work maximization problem on two hierarchical machines with buffer or rearrangements
This page was built for publication: Semi-online hierarchical load balancing problem with bounded processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897964)