Minimizing Total Tardiness on One Machine is NP-Hard (Q3200872): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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.1287/moor.15.3.483 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2030250600 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing Total Tardiness on One Machine is NP-Hard |
scientific article |
Statements
Minimizing Total Tardiness on One Machine is NP-Hard (English)
0 references
1990
0 references
one-machine scheduling
0 references
total tardiness
0 references
due dates
0 references
