A branch-and-bound algorithm to minimize the line length of a two-sided assembly line (Q976518)
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 branch-and-bound algorithm to minimize the line length of a two-sided assembly line |
scientific article; zbMATH DE number 5720441
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm to minimize the line length of a two-sided assembly line |
scientific article; zbMATH DE number 5720441 |
Statements
A branch-and-bound algorithm to minimize the line length of a two-sided assembly line (English)
0 references
11 June 2010
0 references
manufacturing
0 references
branch-and-bound
0 references
assembly line balancing
0 references
two-sided assembly line
0 references
0 references
0 references
0.8824691772460938
0 references
0.8406361937522888
0 references
0.8317245244979858
0 references
0.8299296498298645
0 references
0.8290061354637146
0 references
