Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. (Q1603395)
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: Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. |
scientific article; zbMATH DE number 1767193
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. |
scientific article; zbMATH DE number 1767193 |
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
