Purpose: The main aim of this paper is to develop a new mathematical model for the mixed model two-sided assembly line balancing problem (MTALBP) generally occurs 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 two-sided mixed-model assembly line balancing problem with lower and upper bound. The proposed mathematical model is solved using a branch and bound algorithm on LINGO 17.0 solver.
Findings: Based on the computational result, line efficiency that is obtained by reducing single and mated stations of the assembly line is good as compare to the theoretical minimum number of stations and reduces computational time by applying boundary conditions.
Practical implications: Since the problem is well known as an NP-hard problem a benchmark study problem is solved,and the result of the study can be beneficial for assembly of the mixed model products in term of minimizing mated stations as well as computational time.
Originality: By literature review, t his paper is first to address mixed-model two-sided assembly line balancing problem with bounds using the exact solution approach.
A Mathematical Formulation for Mixed Model Two Sided Assembly Line Balancing Problem to Consider Boundary Conditions
