Pages that link to "Item:Q1949673"
From MaRDI portal
The following pages link to Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine (Q1949673):
Displaying 5 items.
- A polynomial-time approximation scheme for maximizing the minimum machine completion time (Q1362519) (← links)
- LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← links)
- \(N\)-extendible posets, and how to minimize total weighted completion time (Q1962041) (← links)
- On scheduling coflows (Q2211360) (← links)
- Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine (Q2686863) (← links)