A tabu search algorithm for the simple assembly line balancing problem of type-2 with workload balancing objective

In this study, a tabu search algorithm is developed to solve the bi-objective simple assembly line balancing problem of type-2. The algorithm uses a task oriented solution representation which is usually employed by evolutionary algorithms and is supported by a diversification strategy based on residence frequencies. The performance of the algorithm is tested on 23 instances included in 9 problems taken from the open literature. The computational results validate the effectiveness of the algorithm for both objectives.