A Decomposition Approach for Sequencing Mixed-Model Two-Sided Assembly Line with Stochastic Processing Time

Jiaxi Wu, Jing Shang (), Jibin Wang (), Zhen Li (), Zhihui Wu () and Limin Xiao ()
Additional contact information
Jiaxi Wu: China Mobile Information Technology Center, Beijing, P. R. China
Jing Shang: China Mobile Information Technology Center, Beijing, P. R. China
Jibin Wang: China Mobile Information Technology Center, Beijing, P. R. China
Zhen Li: China Mobile Information Technology Center, Beijing, P. R. China
Zhihui Wu: China Mobile Information Technology Center, Beijing, P. R. China
Limin Xiao: State Key Laboratory of Complex & Critical, Software Environment (CCSE), School of Computer, Science and Engineering, Beihang University, Beijing, P. R. China

Asia-Pacific Journal of Operational Research (APJOR), 2025, vol. 42, issue 03, 1-33

Abstract: This study tackles the challenge of optimizing mixed-model two-sided assembly lines, where task processing times are uncertain. The objective is to reduce the expected cycle time the average time to complete one product across the assembly line. Given the complexity of assessing objectives amidst stochastic conditions, we formulate the problem as a simulation optimization problem. We introduce a strategic decomposition method that breaks down the core problem into two discrete sub-tasks: allocating tasks to respective work-stations, and determining the sequence of tasks at each station. The decomposition framework systematically partitions the solution space, though it does not ensure a global optimum, it can efficiently guide the search towards a high-quality near-optimal solution with a practical time frame. Based on this framework, we develop a novel simulation-optimization algorithm, termed the Decomposition Approach with Harmony Search (DAHS), which incorporates a harmony search heuristic to effectively navigate the partitioned solution space. Additionally, we implement two innovative strategies to improve the search and simulation procedures. Numerical experiments reveal that our DAHS algorithm outperforms benchmark algorithms in terms of solution quality and computational efficiency.

Keywords: Two-sided assembly line balancing; stochastic task times; decomposition approach; Harmony search; simulation and optimization (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595924500210
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:42:y:2025:i:03:n:s0217595924500210

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595924500210

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().