Heuristic Algorithm for Type II Two-sided Assembly Line Rebalancing Problem with Multi-objective

• Main Authors: Zhang Yahui, Hu Xiaofeng, Wu Chuanxun
• Format: Article
• Language: English
• Published: EDP Sciences 2018-01-01
• Series: MATEC Web of Conferences
• Online Access: https://doi.org/10.1051/matecconf/201817503063

In practical production, the balance of the assembly lines is always destroyed by many factors, e.g., demand fluctuations, disruptions caused by workstation breakdowns or shutdowns, and changes of the work force. Therefore, this paper addresses the type II rebalancing problem for the two-sided assembly lines (TALRBP-II), which are widely utilized to assemble large-size high-volume products. As we all know that TALBP-II (two-sided assembly line balancing problem type-II) is NP-hard, TALRBP-II is its extension and much more complex. In order to solve this problem, a mathematical model with the objectives of minimizing cycle time and rebalancing cost is proposed. Constraint programming (CP) method is applied to optimize the model and a workstation-oriented heuristic algorithm is designed to solve the problem. An example is presented to illustrate the procedure of the proposed algorithm, and the best solution obtained verify the efficiency of the proposed algorithm.