Heuristic Algorithm for Two-sided Assembly Line Balancing Problem with Multi-objectives

This paper proposes a heuristic algorithm for two-sided assembly line balancing problem to minimize line length and smoothness index. First, the branch-and-bound algorithm is adopted to find the solution with minimal line length. Then, the station neighborhood is defined. With the constraints of the line length, precedence and operational directions, some tasks are reassigned by comparing the loads of stations in the neighborhood to minimize the smoothness index. Finally, an example is used to show the procedure of the proposed algorithm, and the better solution is obtained.