A Comparative Study Of Largest Candidate Rule And Ranked Positional Weights Algorithms For Line Balancing Problem
European Journal of Molecular & Clinical Medicine,
2020, Volume 7, Issue 8, Pages 3768-3775
AbstractThe manufacturing companies are competing among themselves to be the leading manufacturer in the share market. With the rapid increasing competition in the market, the companies need to improve their operation by producing high-quality products, operated at the lowest possible cost. Thus, to achieve this target, the bottleneck problem which affects the idle time and efficiency in the assembly line needs to be investigated. Besides, it also affects the production rate of the assembly line and can have a huge impact on the increase in operational costs. Since there are various line balancing algorithms available as the solution for the bottleneck problem, it is crucial to determine which line balancing algorithm works the best for the associated assembly line. Therefore, this study aims to analyze and compare the two most frequently used line balancing algorithms, which are the Largest Candidate Rule (LCR) and Ranked Positional Weights (RPW) algorithm. The studied applied to three different industries, which are electronic, food and automotive industries. The analysis and comparison are achieved through findings from Microsoft Excel calculation and simulation in Delmia Quest. The study indicates the best line balancing algorithm for the line balancing problem by these two parameters which are the line balance efficiency, Eb and the balance delay, d. According to the findings of the study, the best line balancing algorithm is dependable on the case study to be solved.
- Article View: 75
- PDF Download: 105