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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.030 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093570686 / rank | |||
Normal rank | |||
Revision as of 00:03, 20 March 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
