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