An Integrated Method for Solving the Two-Sided Assembly Line Balancing Problems

Abstract

The problems of parallel two-sided assembly lines balancing (TALB) are nonpolynomial (NP-hard) problems that belong to the field of combinatorial optimization. In most cases, these problems can be resolved with algorithms. To this end, this research adopts colored Petri nets (CPN) and a minimal spanning tree (MST) to address the type I problems for two-sided assembly line balancing problem (TALBP). This research proposes a three-step method. In the first step, a reachability tree chart is built to show potential tasks order assignment. In the second step, the color firing mechanism is employed to determine if the colored conditions are satisfied. The final step uses a MST and a least-time prioritized rule to select the proper tasks for assignment efficiently. These steps will be performed repetitively until all the tasks are properly assigned. Since the whole assignment process is based on graphical and paradigm methods, it can be adopted to lessen the burdens of complex calculations. The end of the research will present the comparison results between the examples from the literature and the method proposed in this research. As indicated by the research findings, employing CPN and an MST for TALBPs (type-I) can obtain even favorable and consistent results over legacy methods, and further optimize workstation design and enhance balance efficiency.