Pages that link to "Item:Q4600609"
From MaRDI portal
The following pages link to Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity (Q4600609):
Displaying 5 items.
- Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization (Q256707) (← links)
- Single machine total tardiness maximization problems: complexity and algorithms (Q367638) (← links)
- A generic approach to proving NP-hardness of partition type problems (Q608273) (← links)
- Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine (Q827995) (← links)
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818) (← links)
