Pages that link to "Item:Q256707"
From MaRDI portal
The following pages link to Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization (Q256707):
Displaying 3 items.
- Algorithms for some maximization scheduling problems on a single machine (Q612210) (← links)
- On minimizing the sum of \(k\) tardinesses (Q1178234) (← links)
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818) (← links)