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):
Displayed 4 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)
- Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty (Q2336632) (← links)