A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem (Q1819236)
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: A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem |
scientific article; zbMATH DE number 1385338
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem |
scientific article; zbMATH DE number 1385338 |
Statements
A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem (English)
0 references
3 September 2001
0 references
computational analysis
0 references
0.90284365
0 references
0.9023819
0 references
0.88702875
0 references
0.88617563
0 references
0.8788687
0 references
0.8779582
0 references
0.87376726
0 references
