A Tabu Search Algorithm for Type-2 U-Shaped Simple Assembly Line Balancing Problem


Arıkan M.

Sixteenth International Conference on Management Science and Engineering Management, Ankara, Turkey, 4 - 05 August 2022, pp.435-449

  • Publication Type: Conference Paper / Full Text
  • Doi Number: 10.1007/978-3-031-10388-9_32
  • City: Ankara
  • Country: Turkey
  • Page Numbers: pp.435-449
  • Gazi University Affiliated: Yes

Abstract

oday, U-shaped assembly lines are widely used by manufacturers operating on the Just-in-Time Production (JIT) principle. As in simple assembly line balancing problems, it is common to classify balancing problems in U-shaped lines as type-1, which minimizes the number of stations when the cycle time is given, and type-2, which minimizes the cycle time when the number of stations is given. Type-1 and type-2 assembly line balancing problems are NP-hard. A type-1 problem is needed to be solved when it is decided to establish a new assembly line and product demand can be well predicted while a type-2 problem is solved when an assembly line is available and it is necessary to increase the production rate. In this study, a tabu search algorithm is developed for type-2 U-shaped simple assembly line balancing problem, which considers workload smoothing as the secondary objective. There is no a tabu search algorithm developed before in the literature for the considered problem. The performance of the algorithm is evaluated on test problems taken from the literature. The experimental outcomes show that the proposed approach can find good results in short times.