A special case of the single-machine total tardiness problem is NP-hard (Q1946412): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s1064230706030117 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2621839118 / rank | |||
Normal rank | |||
Latest revision as of 09:44, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A special case of the single-machine total tardiness problem is NP-hard |
scientific article |
Statements
A special case of the single-machine total tardiness problem is NP-hard (English)
0 references
12 April 2013
0 references
0 references
