Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited (Q515553)
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: Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited |
scientific article; zbMATH DE number 6695553
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited |
scientific article; zbMATH DE number 6695553 |
Statements
Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited (English)
0 references
16 March 2017
0 references
flow shop problems
0 references
NP-hardness
0 references
complexity
0 references
0 references
0 references
0 references
0.8788687
0 references
0.84184664
0 references
0.8418015
0 references
0.8403102
0 references
0.8392221
0 references
0.8355503
0 references
0.8354993
0 references
