Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. (Q1603395): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:37, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. |
scientific article |
Statements
Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. (English)
0 references
14 July 2002
0 references
Scheduling
0 references
Computational complexity
0 references
