An efficient algorithm for U-type assembly line re-balancing problem with stochastic task times

Abstract

Purpose

Changing the product characteristics and demand quantity resulting from the variability of the modern market leads to re-assigned tasks and changing the cycle time on the production line. Therefore, companies need re-balancing of their assembly line instead of balancing. The purpose of this paper is to propose an efficient algorithm approach for U-type assembly line re-balancing problem using stochastic task times.

Design/methodology/approach

In this paper, a genetic algorithm is proposed to solve approach for U-type assembly line re-balancing problem using stochastic task times.

Findings

The performance of the genetic algorithm is tested on a wide variety of data sets from literature. The task times are assumed normal distribution. The objective is to minimize total re-balancing cost, which consists of workstation cost, operating cost and task transposition cost. The test results show that proposed genetic algorithm approach for U-type assembly line re-balancing problem performs well in terms of minimizing total re-balancing cost.

Practical implications

Demand variation is considered for stochastic U-type re balancing problem. Demand change also affects cycle time of the line. Hence, the stochastic U-type re-balancing problem under four different cycle times are analyzed to present practical case.

Originality/value

As per the authors’ knowledge, it is the first time that genetic algorithm is applied to stochastic U-type re balancing problem. The large size data set is generated to analyze performance of genetic algorithm. The results of proposed algorithm are compared with ant colony optimization algorithm.

Citation

Serin, F., Mete, S. and Çelik, E. (2019), "An efficient algorithm for U-type assembly line re-balancing problem with stochastic task times", Assembly Automation, Vol. 39 No. 4, pp. 581-595. https://doi.org/10.1108/AA-07-2018-106