A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem (Q6568392)
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, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem |
scientific article; zbMATH DE number 7877695
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem |
scientific article; zbMATH DE number 7877695 |
Statements
A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem (English)
0 references
8 July 2024
0 references
production
0 references
assembly line balancing
0 references
precedence constraints
0 references
lower bounds
0 references
branch and bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
