Abstract
In this work, we consider a mixed-model two-sided assembly line balancing problem for a given cycle time (MTALBP-I), in which the primary objective is to minimise the number of mated-stations (i.e. the length of the two-sided assembly line), while the number of stations, which describes the total number of operators, is also concerned. To solve this problem, we propose a combinatorial Benders decomposition-based exact algorithm, and develop a sequence-based enumerative search method to calculate effective combinatorial Benders cuts. To evaluate the performance of our proposed solution approach, we conduct extensive computational experiments on a set of benchmark instances, and the results demonstrate its efficiency of finding exact solutions even for large-sized instances.
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 callDisclaimer: 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.
