A fully polynomial approximation scheme for the total tardiness problem (Q1839195)
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 fully polynomial approximation scheme for the total tardiness problem |
scientific article; zbMATH DE number 3807357
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully polynomial approximation scheme for the total tardiness problem |
scientific article; zbMATH DE number 3807357 |
Statements
A fully polynomial approximation scheme for the total tardiness problem (English)
0 references
1982
0 references
fully polynomial approximation scheme
0 references
single machine
0 references
pseudopolynomial algorithm
0 references
job sequencing
0 references
minimization of total tardiness
0 references
