A faster fully polynomial approximation scheme for the single-machine total tardiness problem (Q958114): 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.ejor.2007.12.031 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1976596296 / rank | |||
Normal rank | |||
Revision as of 23:38, 19 March 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
