Optimal online algorithms on two hierarchical machines with resource augmentation
From MaRDI portal
Publication:2905313
Recommendations
- Optimal online algorithms on two hierarchical machines with resource augmentation
- Optimal online algorithms for hierarchical scheduling on three parallel machines
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation
- Approximation and Online Algorithms
- Online parallel machines scheduling with two hierarchies
Cites work
- A note on hierarchical scheduling on two uniform machines
- Bounds for Certain Multiprocessing Anomalies
- On-line algorithms for the channel assignment problem in cellular networks.
- On-line load balancing in a hierarchical server topology
- Online and semi-online scheduling of two machines under a grade of service provision
- Online parallel machines scheduling with two hierarchies
- Online scheduling on parallel machines with two goS levels
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Preemptive scheduling on a small number of hierarchical machines
- The hierarchical model for load balancing on two machines
Cited in
(5)- scientific article; zbMATH DE number 1839473 (Why is no real title available?)
- Optimal online algorithms on two hierarchical machines with resource augmentation
- Optimal Online Algorithms for Minimax Resource Scheduling
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation
- Approximation and Online Algorithms
This page was built for publication: Optimal online algorithms on two hierarchical machines with resource augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2905313)
