A fully polynomial approximation scheme for the total tardiness problem (Q1839195): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Eugene L. Lawler / rank | |||
| Property / author | |||
| Property / author: Eugene L. Lawler / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(82)90022-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2022265817 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3912008 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3940839 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4124332 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:47, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully polynomial approximation scheme for the total tardiness problem |
scientific article |
Statements
A fully polynomial approximation scheme for the total tardiness problem (English)
0 references
1982
0 references
fully polynomial approximation scheme
0 references
single machine
0 references
pseudopolynomial algorithm
0 references
job sequencing
0 references
minimization of total tardiness
0 references
