Pages that link to "Item:Q5920391"
From MaRDI portal
The following pages link to Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (Q5920391):
Displaying 6 items.
- Average and worst-case analysis of heuristics for the maximum tardiness problem (Q1080771) (← links)
- Evaluation of leading heuristics for the single machine tardiness problem (Q1278530) (← links)
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty (Q2336632) (← links)
- Evaluation of greedy, myopic and less-greedy heuristics for the single machine, total tardiness problem (Q4347409) (← links)
- Worst-case analysis of local search heuristic for the one-machine total tardiness problem (Q4735025) (← links)
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (Q5892099) (← links)