Combinatorial Benders decomposition for mixed-model two-sided assembly line balancing problem
针对给定节拍的混合模型双边装配线平衡问题，提出基于组合Benders分解的精确算法，通过序列枚举搜索生成有效割，在基准实例上验证了求解大规模问题的效率。
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.