Complexity of problem \(TF2|v=1,c=2|C_{\max}\) (Q888964)
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: Complexity of problem TF2|v=1,c=2|C_ |
scientific article; zbMATH DE number 6504976
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of problem \(TF2|v=1,c=2|C_{\max}\) |
scientific article; zbMATH DE number 6504976 |
Statements
Complexity of problem \(TF2|v=1,c=2|C_{\max}\) (English)
0 references
5 November 2015
0 references
analysis of algorithms
0 references
flow shop scheduling
0 references
interstage transporter
0 references
NP-hardness
0 references
optimization
0 references
0 references
0 references
0 references
0.8380278
0 references
0.83205837
0 references
0.83205837
0 references
0.8287663
0 references
0.82149947
0 references
0.82149947
0 references
0.81931984
0 references
0.81773543
0 references
