A faster fully polynomial approximation scheme for the single-machine total tardiness problem (Q958114)
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: A faster fully polynomial approximation scheme for the single-machine total tardiness problem |
scientific article; zbMATH DE number 5376975
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster fully polynomial approximation scheme for the single-machine total tardiness problem |
scientific article; zbMATH DE number 5376975 |
Statements
A faster fully polynomial approximation scheme for the single-machine total tardiness problem (English)
0 references
2 December 2008
0 references
single-machine sequencing
0 references
total tardiness
0 references
fully polynomial approximation
0 references
0 references
