Pages that link to "Item:Q958114"
From MaRDI portal
The following pages link to A faster fully polynomial approximation scheme for the single-machine total tardiness problem (Q958114):
Displaying 12 items.
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504) (← links)
- The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
- A polynomial-time approximation scheme for maximizing the minimum machine completion time (Q1362519) (← links)
- Fast fully polynomial approximation schemes for minimizing completion time variance (Q1600838) (← links)
- Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818) (← links)
- An exact exponential branch-and-merge algorithm for the single machine total tardiness problem (Q1786599) (← links)
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty (Q2336632) (← links)
- A note on ``Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date'' (Q2446866) (← links)
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem (Q4950821) (← links)
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (Q5892099) (← links)
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (Q5920391) (← links)
