A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (Q861263)
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 single machine weighted total tardiness problem with a common due date |
scientific article; zbMATH DE number 5083786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date |
scientific article; zbMATH DE number 5083786 |
Statements
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (English)
0 references
9 January 2007
0 references
single machine scheduling
0 references
weighted total tardiness
0 references
dynamic programming
0 references
FPTAS
0 references
0 references
0 references
0 references
0 references
0 references
0.9501940011978148
0 references
0.9043952822685242
0 references
0.8858933448791504
0 references
