Tabu search approach for type 2 problem of assembly line balacing

Abstract

In this research, Tabu search algorithm, a heuristic method for solving combinatorial optimization problems, has been applied for type 2 problems of assembly line balancing. For type 2 problems, two methodologies are developed for problem solving. Method 1 is direct solving for type 2 problems, and method 2 gives solving through type 1 problems. As such, Tabu search algorithm for type 1 problem is employed for problem solving at second stage. The success of this research points out empty workstations (unnecessary) to reduce investment cost and operational costs. Moreover, the range of cycle time and number of workststions are provided for selection.