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 the normal view instead:
scientific article; zbMATH DE number 1767193
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8705360889434814
0 references
0.8301014304161072
0 references
0.8266194462776184
0 references
0.8230656981468201
0 references
