A special case of the single-machine total tardiness problem is NP-hard (Q1946412): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Evgeny R. Gafarov / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Alexander A. Lazarev / rank | |||
Normal rank |
Revision as of 22:41, 13 February 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