Minimize Idle Time in Two Sided Assembly Line Balancing Using Exact Search Approach

Abstract

Growing interests of customers in customized products and increasing competitions between companies to configure and balance their manufacturing systems more effectively within limited space and time. Two-sided assembly lines are usually constructed to produce large-sized high volume products such as buses, trucks, automobiles, and some domestic products In this paper, the proposed mathematical model is applied to solve benchmark problems of two-sided assembly line balancing problem to maximize the workload on each workstation which tends to increase the compactness in the beginning workstations which also helps to minimize the length and idle time of the line. Since the problem is well known as np-hard problem a lingo solver based solution method is proposed to solve the problem. Through computational experiments, the performance of the proposed Lingo model is checked with various benchmark problem instances. Based on the computational results, idle time in mated stations and the length of the mated station's line is decreased.