Algorithms for the assembly line balancing problem: a case study of the Matsushita Electric Company in Tanzania

In this research, a Tabu search algorithm for the Assembly Line Balancing problem type-1 and type-2 are described. The Assembly Line Balancing Problem type-1 (ALBP1), is the problem of minimising the number of workstations for a given cycle time, whereas type-2 (ALBP-2) is to maximise production rate, or equivalently to minimise the sum of idle times for a given number of workstations. In both problem types, precedence constraints between the tasks have to be considered. Tabu Search and Kilbride & Wester algorithms for the assembly line balancing problem type-1 are developed and comparison of performances of the two heuristics over the assembly line balancing is done. Lastly, the exact approach is applied to a small sized assembly line balancing problem type-1. Its results are compared with the results of Tabu Search and Kilbride & Wester heuristics over the assembly line balancing problem type-1 to prove their efficiency. It is concluded that, .both Tabu search and Kilbride & Wester algorithms are good approaches to the Assembly Line Balancing Problem type-1