Abstract

Two-sided (left- and right-side) assembly lines are often used in assembly of large-sized products, such as buses and trucks. A large number of exact algorithms and heuristics have been proposed to balance the well-known classical one-sided assembly lines. However, little attention has been paid to balancing the two-sided lines. Moreover, according to our best knowledge, there is no published work in balancing the two-sided assembly line exactly. In this study, a branch-and-bound algorithm is proposed to solve the balancing problem optimally. Experiments are carried out to demonstrate the performance of the proposed method and the results are promising.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.