Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements (Q2629595)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6601353
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements |
scientific article; zbMATH DE number 6601353 |
Statements
Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements (English)
0 references
6 July 2016
0 references
heuristic
0 references
lower bound
0 references
assembly line balancing
0 references
reduction technique
0 references
partitioning problem
0 references
0 references
0 references
0.8695758581161499
0 references
0.8695412278175354
0 references
0.8607934713363647
0 references
0.853551983833313
0 references
0.8461715579032898
0 references
