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.

A Demand-Driven Model for Reallocating Workers in Assembly Lines

“…Lost sales in the six subgroups of the "difficult, erratic" scenario (cases 49-54) resulted in the same amount as in their counterparts, "difficult, increasing" (13)(14)(15)(16)(17)(18) and "difficult, seasonally increasing" (31)(32)(33)(34)(35)(36). In these cases, there was no worker reallocation.…”

“…Serin et al [31] continued the work of Çelik et al [7]. The authors designed a GA to address the S-ULRBP.…”

“…Finally, equations ( 28)- (31) compute the IFP at the beginning and at the end of each period `. The equations are selfexplanatory.…”

A novel optimization approach for segmented rabbit chase oriented U-type assembly line design: an application from lighting industry

“…Kara et al (2011) also stated that operating cost could be decreased through a design change from straight line to U-type line under resourcedependent task times. Besides, randomness (Celik et al, 2014;Tiacci, 2017;Serin et al, 2019), interval data (Hazir and Dolgui, 2015) and fuzziness (Zhang and Cheng, 2015;Alavidoost et al, 2017) were also considered for task times in UALBP.…”

Modelling and Solving Assembly Line Worker Assignment and Balancing Problem with Sequence-Dependent Setup Times

“…Assembly lines have been used extensively to produce high-volume products in the industry and one of the well-known research areas in the production environment [1]. Assembly line balancing problem can be defined as assigning tasks to workstations, considering the constraints on the line.…”