Implementation of ranked positional weight method (RPWM) for double-sided assembly line balancing problems

2017 ◽  
Author(s):  
M. F. M. A. Hamzas ◽  
S. A. Bareduan ◽  
M. Z. Zakaria ◽  
S. Ghazali ◽  
S. Zairi
Keyword(s):  
Assembly Line ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Weight Method ◽  
Positional Weight

Assembly Line Re-Balancing Using Ranked Positional Weight Technique and Longest Operating Time Technique: A Comparative Analysis

2013 ◽  
Vol 824 ◽  
pp. 568-578 ◽  
Author(s):  
Ralph O. Edokpia ◽  
F.U. Owu
Keyword(s):  
Large Scale ◽  
Assembly Line ◽  
Production Systems ◽  
Operating Cost ◽  
Operating Time ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Single Model ◽  
Minimum Number ◽  
Positional Weight

Assembly line balancing is an attractive means of mass manufacturing and large-scale serial production systems. Traditionally, assembly lines are arranged in straight single-model lines and the problem is known as Simple Assembly Line balancing problem (SALBP). In this study, two heuristic assembly line balancing techniques known as the Ranked Positional Weight Technique, and the longest operational time technique, were applied to solve the problem of single-model line balancing problem in an assembling company with the aim of comparing the efficiencies of the application of the two algorithms. By using both methods, different restrictions were taken into consideration and two different lines balancing results were obtained. From the results obtained, Longest Operating Time Technique has higher line efficiency (85.16%) as compared to Ranked positional weight technique (79.28%) and it is easy to apply. The LOT technique gave the minimum number of workstations (27) as compared to the RPW technique (29); however the line efficiency and the number of workstation of the existing line are 74.67% and 31 respectively. This implies that the LOT technique has a better reduction in operating cost.

An Effective Grouping Evolution Strategy Algorithm Enhanced with Heuristic Methods for Assembly Line Balancing Problem

2019 ◽  
Vol 18 (03) ◽  
pp. 487-509
Author(s):  
Mazyar Ghadiri Nejad ◽  
Ali Husseinzadeh Kashan
Keyword(s):  
Assembly Line ◽  
Group Structure ◽  
Heuristic Method ◽  
Assembly Line Balancing ◽  
Evolution Strategy ◽  
Line Balancing ◽  
Test Problems ◽  
Production Volume ◽  
Assembly Line Balancing Problem ◽  
Positional Weight

Assembly line balancing problem (ALBP) is an allocation of given tasks to the workstations in a way that the number of workstations or the idle times of workstations get minimized. ALBP is a well-known problem in mass-production systems with high production volume and low diversity. In division and grouping allocation problems like ALBP, metaheuristic algorithms based on group structure, i.e. grouping genetic algorithm, are more efficient. The aim of this study is developing a new solution procedure to minimize the number of workstations for a given cycle time based on grouping evolution strategy. A modification of the ranked positional weight method is proposed to construct the initial solution, and a new heuristic method based on a modified version of the COMSOAL method is provided to tighten the solution after performing the mutation operator. Different strategies based on line efficiency and line smoothness indexes are considered to select the best result and transfer it to the next generation. Moreover, to evaluate the performance of proposed algorithms, some well-known standard test problems are utilized. Computational results indicate that the proposed solution algorithm performs efficiently and can obtain the optimal global solution in most of the high dimensional problems.

Heuristic production line balancing problem solution with MATLAB software programming

2016 ◽  
Vol 28 (6) ◽  
pp. 750-779 ◽  
Author(s):  
Aysun Türkmen ◽  
Yalcin Yesil ◽  
Mahmut Kayar
Keyword(s):  
Computer Program ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Development Program ◽  
Line Balancing ◽  
Problem Solution ◽  
Matlab Software ◽  
Content Type ◽  
Weight Method ◽  
Assembly Line Balancing Problem

Purpose The purpose of this paper is to find the most efficient assembly line balancing solution across many heuristic line balancing methods, in assistance with a developed computer program. Design/methodology/approach In this paper, assembly line balancing problem was analyzed using t-shirt and knitted pants data. A computer program using MATLAB software for the solution of assembly line balancing problems has been developed. In this study, following heuristic assembly line balancing methods were applied: Hoffman method; position weight method; COMSOAL method; and Kilbridge and Wester method. A MATLAB program has been developed by taking into account of theoretical solution of all these methods. Later the program is developed further by analyzing solutions made manually and is made to verify the developed program. Findings Pre-studies which were conducted in order to decide which programming language would be the best choice for line balancing methods’ application came out with the result that MATLAB, from between C, C++, C# and Java, would be the best software choice. The main reason for this choice is that MATLAB is a powerful matrix operation software with a powerful user interface designing tool and has the tools to make development program to be used universally in every computer. Originality/value When the researches were investigated, it is clearly seen that, this study is the first research on using computer program for solving assembly line balancing problem.

An Improved Two-Sided Assembly Line Balancing Algorithm Based on Heuristic Rules

2013 ◽  
Vol 404 ◽  
pp. 758-763
Author(s):  
Yan Gao ◽  
Tian Xiang Chang ◽  
Yang Yang Wang ◽  
Yao Liu ◽  
Hong Yan Quan ◽  
...  
Keyword(s):  
Mathematical Model ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Optimal Solution ◽  
Line Balancing ◽  
Heuristic Rules ◽  
Positional Weight ◽  
Task Assignments ◽  
Improved Algorithm

According to Assemble line balancing (ALB) problem which is widespread in manufacture, we establish a mathematical model and present our improved algorithm that is based on Heuristic rules, which adopt cumulative ranked positional weight as a basis of task assignments and schedule the orders of branches traversal. After that we can find an optimal solution to the balancing problem efficiently. The result of examples given by this paper shows our algorithm has a good performance.

Sign in / Sign up

Export Citation Format

Share Document