Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (Q5892099)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem |
scientific article; zbMATH DE number 6389234
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem |
scientific article; zbMATH DE number 6389234 |
Statements
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (English)
0 references
22 January 2015
0 references
total tardiness
0 references
scheduling
0 references
approximation
0 references
