A special case of the single-machine total tardiness problem is NP-hard (Q1946412)
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: A special case of the single-machine total tardiness problem is NP-hard |
scientific article; zbMATH DE number 6153775
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A special case of the single-machine total tardiness problem is NP-hard |
scientific article; zbMATH DE number 6153775 |
Statements
A special case of the single-machine total tardiness problem is NP-hard (English)
0 references
12 April 2013
0 references
0 references
