Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri
Ferry Mario Sugiarta
BINUS Graduate Program
Industrial & Manufacturing Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Optimization of Multi-Manned Assembly Line Balancing with Workload Smoothing using Simulated Annealing Based Hyper-Heuristic Ferry Mario Sugiarta; Suharjito
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 28 No. 2 (2026): December 2026 (Pre-Print)
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/jti.28.2.103 - 116

Abstract

In most cases, an assembly line with multi-manned configuration will increase efficiency in productivity. However, the complexity of multi-manned assembly can sometimes lead to bottlenecks rather than improvements in productivity. The smoothness index is a crucial performance indicator in the assembly line balancing problem, as uneven smoothness can create bottlenecks and disparities among workers; unfortunately, it is often neglected. This study developed a model that represents the multi-manned assembly line balancing problem that considers workload smoothing. Although an exact method may give the most optimal answer, due to the NP hard nature of the problem, the exact method becomes infeasible as it will take time to solve. Although in some cases, metaheuristic or hyper-heuristic methods may not guarantee the best solution quality, a near optimal solution can be given in a more reasonable time. Data from real-world cases of assembly lines and benchmark datasets were used to test the model and examine the algorithm's performance. It was found that the hyper-heuristic method based on simulated annealing could find an optimal solution for the number of workers and stations, although it required a slightly longer computation time compared to pure metaheuristic methods.
Co-Authors Suharjito