Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. (Q1853011)
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: Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. |
scientific article; zbMATH DE number 1856356
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. |
scientific article; zbMATH DE number 1856356 |
Statements
Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. (English)
0 references
21 January 2003
0 references
Scheduling
0 references
Single machine multi-operation jobs
0 references
