A multi-manned parallel two-sided assembly line balancing with tool sharing approach-a company case study solved by exact solution approach

Abstract

Purpose-The main aim of this paper is to develop a new mathematical model for the multi-manned parallel two-sided assembly line balancing problem (MPTALBP) generally occur in plants producing large-sized high-volume products such as buses or trucks. Methodology-In this paper, the proposed mathematical model is applied to solve case study of multi-manned parallel two-sided assembly line balancing problem to minimizing the total idle time and reduce the cost associated with tools in mated stations of an assembly line. The proposed mathematical model is solved using a branch and bound algorithm on lingo 17 solvers. Findings-Based on the computational result, it can be seen that less number of workstations are utilized as compared to the theoretical minimum number of workstations with a shared tools approach that reduces space as well as the cost of tools. Practical implications-Since the problem is well known as np-hard problem a company case study problem is solved and the result of the study can be beneficial for the automobile industry to reduce tool cost and overall cost by tools sharing approach. Originality-On the basis of this literature review paper is first to address multi-manned parallel two-sided assembly line balancing problem using the exact solution approach.