New solution proposals to two-sided assembly line balancing problems

In this thesis, new solution proposals to two-sided assembly line balancing problems are presented. First, a new mixed integer mathematical programming model and a tabu search algorithm which minimizes the line length as the primary objective and minimizes the number of operators as a secondary objective are proposed. Second, multiple-criteria decision-making in two-sided assembly line balancing is considered. For this purpose, a new mixed integer goal programming model for precise goals and a new fuzzy mixed integer goal programming model for imprecise goals are presented. Third, a new mixed integer mathematical programming model and a heuristic algorithm are proposed to two-sided assembly line balancing problem with sequence-dependent setup times. The effectiveness of the proposed mathematical models and the heuristic algorithms are investigated on test problems. The proposed mathematical models are solved using GAMS mathematical programming package and the proposed heuristic algorithms have been compiled in MS Visual Basic 6.0.