A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (Q861263): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:04, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date |
scientific article |
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
