Study and Analysis of GA-Based Heuristic Applied to Assembly Line Balancing Problem

2014 ◽  
Vol 13 (02) ◽  
pp. 113-131 ◽  
Author(s):  
P. Sivasankaran ◽  
P. Shahabudeen
Keyword(s):  
Cycle Time ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Optimal Solution ◽  
Vital Role ◽  
Line Balancing ◽  
Problem Size ◽  
Minimum Number ◽  
Assembly Line Balancing Problem ◽  
Balancing Efficiency

Balancing assembly line in a mass production system plays a vital role to improve the productivity of a manufacturing system. In this paper, a single model assembly line balancing problem (SMALBP) is considered. The objective of this problem is to group the tasks in the assembly network into a minimum number of workstations for a given cycle time such that the balancing efficiency is maximized. This problem comes under combinatorial category. So, it is essential to develop efficient heuristic to find the near optimal solution of the problem in less time. In this paper, an attempt has been made to design four different genetic algorithm (GA)-based heuristics, and analyze them to select the best amongst them. The analysis has been carried out using a complete factorial experiment with three factors, viz. problem size, cycle time, and algorithm, and the results are reported.

Assembly Line Balancing Type-2 Using Unequal Multiple Operators

2013 ◽  
Vol 816-817 ◽  
pp. 1169-1173
Author(s):  
Usman Attique ◽  
Abdul Ghafoor ◽  
Riaz Ahmed ◽  
Shahid Ikramullah
Keyword(s):  
Cycle Time ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Computational Effort ◽  
Line Balancing ◽  
Heuristic Methods ◽  
Novel Approach ◽  
Assembly Line Balancing Problem

Various exact and heuristic methods have been proposed for assembly line balancing problem (ALBP) but unequal multiple operators have not been considered much. In this paper we present a novel approach of assembly line balancing Type-2 with unequal multiple operators by using an already developed code in Matlab (Tomlab modeling platform). The adopted approach can be applied at line balancing problems ranging from few to hundreds of work elements to achieve minimum cycle time with very less computational effort.

scholarly journals Cycle time enhancement by simulated annealing for a practical assembly line balancing problem

Informatica ◽  
2020 ◽  
Vol 44 (2) ◽  
Author(s):  
Huong Mai Dinh ◽  
Dung Viet Nguyen ◽  
Long Van Truong ◽  
Thuan Phan Do ◽  
Thao Thanh Phan ◽  
...  
Keyword(s):  
Simulated Annealing ◽  
Cycle Time ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Assembly Line Balancing Problem

Solving Two–Sided Assembly Line Balancing Problem via Gravitational Search Algorithm

2014 ◽  
Vol 697 ◽  
pp. 450-455 ◽  
Author(s):  
Yi Wu ◽  
Qiu Hua Tang ◽  
Li Ping Zhang ◽  
Zi Xiang Li ◽  
Xiao Jun Cao
Keyword(s):  
Assembly Line ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Assembly Line Balancing ◽  
Optimal Solution ◽  
High Volume ◽  
Line Balancing ◽  
Task Sequence ◽  
Gravitational Search ◽  
Assembly Line Balancing Problem

Two-sided assembly lines are widely applied in plants for producing large-sized high volume products, such as trucks and buses. Since the two-sided assembly line balancing problem (TALBP) is NP-hard, it is difficult to get an optimal solution in polynomial time. Therefore, a novel swarm based heuristic algorithm named gravitational search algorithm (GSA) is proposed to solve this problem with the objective of minimizing the number of mated-stations and the number of stations simultaneously. In order to apply GSA to solving the TALBP, an encoding scheme based on the random-keys method is used to convert the continuous positions of the GSA into the discrete task sequence. In addition, a new decoding scheme is implemented to decrease the idle time related to sequence-dependent finish time of tasks. The corresponding experiment results demonstrate that the proposed algorithm outperforms other well-known algorithms.

scholarly journals Assembly Line Balancing the Comparison of COMSOAL and MSNSH Technique in Motorcycle Manufacturing Company

2012 ◽  
Vol 605-607 ◽  
pp. 166-174
Author(s):  
Areeda Lerttira ◽  
Prasad K.D.V. Yarlagadda
Keyword(s):  
Cycle Time ◽  
Manufacturing Systems ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Idle Time ◽  
Line Balancing ◽  
Neighborhood Search ◽  
Manufacturing Company ◽  
Assembly Line Balancing Problem

Today’s highly competitive market influences the manufacturing industry to improve their production systems to become the optimal system in the shortest cycle time as possible. One of most common problems in manufacturing systems is the assembly line balancing problem. The assembly line balancing problem involves task assignments to workstations with optimum line efficiency The most common purposes of Computer Method for Sequencing Operations for Assembly Line (COMSOAL) are to minimise idle time, optimise production line efficiency, and minimise the number of workstations. Therefore, this paper leads to implement COMSOAL to balance an assembly line in the motorcycle industry. The new solution by COMSOAL will be used to compare with the previous solution that was developed by Multi‐Started Neighborhood Search Heuristic (MSNSH), which will result in five aspects including cycle time, total idle time, line efficiency, average daily productivity rate, and the workload balance. The journal name “Optimising and simulating the assembly line balancing problem in a motorcycle manufacturing company: a case study” will be used as the case study for this project.

Sign in / Sign up

Export Citation Format

Share Document