Minimizing Total Tardiness on One Machine is NP-Hard (Q3200872)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:3200872 |
scientific article; zbMATH DE number 4176815
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing Total Tardiness on One Machine is NP-Hard |
scientific article; zbMATH DE number 4176815 |
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
0.911160945892334
0 references
0.8869163393974304
0 references
0.8744062781333923
0 references
0.8530198335647583
0 references
