Name
Abstract | ||
|---|---|---|
•Branch, bound and remember algorithm is improved for UALBP.•Two new dominance rules are developed and proved.•A comprehensive study is carried out to test eight BBR methods.•BBR methods outperform two current best exact methods, ULINO and BPR.•New optimal solutions and upper bounds are achieved for tested benchmarks. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.cie.2018.06.037 | Computers & Industrial Engineering |
Keywords | Field | DocType |
Combinatorial optimization,Assembly line balancing,U-shaped assembly line,Branch and bound, exact solution | Mathematical optimization,Branch and bound,Out of memory,Algorithm,Redundancy (engineering),Engineering,Backtracking,Limiting,Line balancing | Journal |
Volume | ISSN | Citations |
124 | 0360-8352 | 2 |
PageRank | References | Authors |
0.35 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zixiang Li | 1 | 5 | 1.10 |
| ibrahim kucukkoc | 2 | 53 | 7.74 |
| Zikai Zhang | 3 | 8 | 5.89 |