Matroid coflow scheduling
From MaRDI portal
Recommendations
- On scheduling coflows
- On scheduling coflows (extended abstract)
- scientific article; zbMATH DE number 3885638
- scientific article; zbMATH DE number 6678450
- Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time
Cites work
- A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Inapproximability of hypergraph vertex cover and applications to scheduling problems
- Minimizing the sum of weighted completion times in a concurrent open shop
- On scheduling coflows (extended abstract)
- Order Scheduling Models: Hardness and Algorithms
- Preemptive and non-preemptive generalized min sum set cover
- Scheduling Unrelated Machines by Randomized Rounding
- Scheduling orders for multiple product types to minimize total weighted completion time
- Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems
- Testing membership in matroid polyhedra
Cited in
(4)
This page was built for publication: Matroid coflow scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092350)
