An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations (Q339701)
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: An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations |
scientific article; zbMATH DE number 6651793
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations |
scientific article; zbMATH DE number 6651793 |
Statements
An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations (English)
0 references
11 November 2016
0 references
assembly line balancing
0 references
parallel multi-manned stations
0 references
lower bounding
0 references
branch and bound algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.8477263450622559
0 references
0.8471375107765198
0 references
0.8378310799598694
0 references
0.8124575018882751
0 references
0.809789776802063
0 references
