On scheduling coflows
From MaRDI portal
Publication:2211360
Recommendations
- On scheduling coflows (extended abstract)
- Flow-time optimization for concurrent open-shop and precedence constrained scheduling models
- Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms
- Scheduling distributed clusters of parallel machines: primal-dual and LP-based approximation algorithms
- Task scheduling in networks
Cites work
- Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine
- Inapproximability of hypergraph vertex cover and applications to scheduling problems
- Minimizing the sum of weighted completion times in a concurrent open shop
- Order Scheduling Models: Hardness and Algorithms
- Scheduling orders for multiple product types to minimize total weighted completion time
- Structure of a simple scheduling polyhedron
- Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems
Cited in
(7)- Co-scheduling algorithms for high-throughput workload execution
- On scheduling coflows (extended abstract)
- Flow-time optimization for concurrent open-shop and precedence constrained scheduling models
- Matroid coflow scheduling
- Improved approximation algorithms for multiprocessor indivisible coflow scheduling
- Improved approximation algorithms for multiprocessor indivisible coflow scheduling
- Polytope scheduling with groups: unified models and optimal guarantees
This page was built for publication: On scheduling coflows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2211360)
