scholarly journals Optimising and simulating the assembly line balancing problem in a motorcycle manufacturing company: a case study

2009 ◽  
Vol 48 (12) ◽  
pp. 3637-3656 ◽  
Author(s):  
Pablo Cortés ◽  
Luis Onieva ◽  
José Guadix
2012 ◽  
Vol 605-607 ◽  
pp. 166-174
Author(s):  
Areeda Lerttira ◽  
Prasad K.D.V. Yarlagadda

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.


Author(s):  
Ganokgarn Jirasirilerd ◽  
Rapeepan Pitakaso ◽  
Kanchana Sethanan ◽  
Sasitorn Kaewman ◽  
Worapot Sirirak ◽  
...  

This article aims to minimize cycle time for a simple assembly line balancing problem type 2 by presenting a variable neighborhood strategy adaptive search method (VaNSAS) in a case study of the garment industry considering the number and types of machines used in each workstation in a simple assembly line balancing problem type 2 (SALBP-2M). The variable neighborhood strategy adaptive search method (VaNSAS) is a new method that includes five main steps, which are (1) generate a set of tracks, (2) make all tracks operate in a specified black box, (3)operate the black box, (4) update the track, and (5) repeat the second to fourth steps until the termination condition is met. The proposed methods have been tested with two groups of test instances, which are datasets of (1) SALBP-2 and (2) SALBP-2M. The computational results show that the proposed methods outperform the best existing solution found by the LINGO modeling program. Therefore, the VaNSAS method provides a better solution and features a much lower computational time.


Author(s):  
Mohammad Huskhazrin Kharuddin ◽  
Mohammad Fadzli Ramli ◽  
Muhamad Hafiz Masran

<span style="font-size: 9pt; line-height: 107%; font-family: 'Times New Roman', serif;">The assembly line is widely known because the use of it in manufacturing to process raw material into a complete product. There are many discussions and researches have been done in this field and the assembly line balancing problem is one of the topics that attract the interest of many researchers. The technique that frequently uses to solve assembly line balancing is a heuristic procedure. In this paper, a case study about the production of the power converter is studied. The assembly line of the power converter consists of 27 major tasks and 19 workstations. The existing heuristics procedures and a proposed heuristic procedure are used to solve the line balancing problem. After that, simulation is used to obtain the results and by comparing the results for each procedure, the most suitable procedure that should be used to solve the problem is selected.</span>


Author(s):  
Nurhanani Abu Bakar ◽  
Mohammad Fadzli Ramli ◽  
Mohd Zakimi Zakaria ◽  
Tan Chan Sin ◽  
Hafiz Masran

<p>Currently, problem in assembly line has created so much attention, particularly in manufacturing area. Similar to this case study as they faced with problems regarding workstation in production line of electrical industry. There exist some cases where workstations in assembly line are experienced with bottleneck and suffered from high idle time. Thus, four heuristic methods are used for minimizing number or workstations and improve the bottleneck problems at the same time. In this case study, LCR, RPW and LPT have successfully minimized the number of workstations from 19 to 16. This solution has affected the layout of assembly line. Different from SPT that manage to improve the bottleneck among workstations by reducing number of workstations from 19 to 17 without changing the line layout. Therefore, both solution has brought an option for an engineer to choose which decision to be used in this assembly line in order to increase the line efficiency.</p>


Sign in / Sign up

Export Citation Format

Share Document