Risk-aware Balancing of Cooperative Mixed-model Assembly Lines with Correlated Task Times
DOI:
https://doi.org/10.54097/32vs9j62Keywords:
Mixed-model assembly line balancing; cooperative tasks; correlated task times; conditional value-at-risk; adaptive neighborhood search; discrete-event simulation.Abstract
This study jointly optimizes task assignments, worker crews and sequences in cooperative mixed-model assembly lines with correlated task times. A lognormal common-factor model represents within-product dependence, and a tail-bottleneck-guided adaptive neighborhood search minimizes the conditional value-at-risk of normalized cycle-time overruns under fixed staffing. Crews and orders are committed before uncertainty is realized; task starts depend on predecessor completion. Seven methods are evaluated through twenty runs on each of 48 instances extended from eight public precedence graphs. Complete enumeration and an independent SimPy model verify small-instance solutions and execution consistency. At 2000 candidate evaluations, ALNS-R reduces mean out-of-sample CVaR by 20.70% relative to deterministic balancing. Product-stream CVaR decreases by 16.08%, while normalized throughput increases by 0.56% in relative terms. Correlation and budget analyses delimit these gains, including nonsignificant comparisons and nonmonotonic scenario-count effects.
Downloads
References
[1] Boysen, N., Fliedner, M., & Scholl, A. (2007). A classification of assembly line balancing problems. European Journal of Operational Research, 183(2), 674–693. https://doi.org/10.1016/j.ejor.2006.10.010 DOI: https://doi.org/10.1016/j.ejor.2006.10.010
[2] Battaïa, O., & Dolgui, A. (2013). A taxonomy of line balancing problems and their solution approaches. International Journal of Production Economics, 142(2), 259–277. https://doi.org/10.1016/j.ijpe.2012.10.020 DOI: https://doi.org/10.1016/j.ijpe.2012.10.020
[3] Scholl, A., & Becker, C. (2006). State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. European Journal of Operational Research, 168(3), 666–693. https://doi.org/10.1016/j.ejor.2004.07.022 DOI: https://doi.org/10.1016/j.ejor.2004.07.022
[4] Jiao, Y. L., Deng, X., Li, L., et al. (2023). Balancing and collaborative optimization of two-sided U-type assembly line with multi-constraint. Journal of Jilin University (Engineering and Technology Edition), 53(7), 2053–2060. https://doi.org/10.13229/j.cnki.jdxbgxb.20211050
[5] Jiao, Y. L., Deng, X., Li, J., et al. (2025). Mathematical model and heuristics for balancing of mixed-model parallel two-sided assembly line. Computer Integrated Manufacturing Systems, 31(8), 2797–2805. https://doi.org/10.13196/j.cims.2022.0995
[6] Zhang, M., Tian, Z. Y., Zhu, J. H., et al. (2024). Multi-manned collaborative mixed-model assembly line balancing optimization based on deep reinforcement learning. Control and Decision, 39(10), 3395–3404. https://doi.org/10.13195/j.kzyjc.2023.0820
[7] Roshani, A., & Ghazi Nezami, F. (2017). Mixed-model multi-manned assembly line balancing problem: A mathematical model and a simulated annealing approach. Assembly Automation, 37(1), 34–50. https://doi.org/10.1108/aa-02-2016-016 DOI: https://doi.org/10.1108/AA-02-2016-016
[8] Michels, A. S., & Costa, A. M. (2024). Model and heuristics for the multi-manned assembly line worker integration and balancing problem. International Journal of Production Research, 62(24), 8719–8744. https://doi.org/10.1080/00207543.2024.2347572 DOI: https://doi.org/10.1080/00207543.2024.2347572
[9] Hashemi-Petroodi, S. E., Thevenin, S., Kovalev, S., et al. (2023). Markov decision process for multi-manned mixed-model assembly lines with walking workers. International Journal of Production Economics, 255, 108661. https://doi.org/10.1016/j.ijpe.2022.108661 DOI: https://doi.org/10.1016/j.ijpe.2022.108661
[10] Zakaraia, M., Zaher, H., & Ragaa, N. (2022). Solving stochastic multi-manned U-shaped assembly line balancing problem using differential evolution algorithm. International Journal of Production Management and Engineering, 10(1), 13–22. https://doi.org/10.4995/ijpme.2021.16084 DOI: https://doi.org/10.4995/ijpme.2021.16084
[11] Yasmeen, S., Keskin, M. E., & Yilmaz, H. (2025). Multi-manned assembly line balancing problem with stochastic processing times. Flexible Services and Manufacturing Journal. https://doi.org/10.1007/s10696-025-09641-6 DOI: https://doi.org/10.1007/s10696-025-09641-6
[12] Diefenbach, J., & Stolletz, R. (2022). Stochastic assembly line balancing: General bounds and reliability-based branch-and-bound algorithm. European Journal of Operational Research, 302(2), 589–605. https://doi.org/10.1016/j.ejor.2022.01.015 DOI: https://doi.org/10.1016/j.ejor.2022.01.015
[13] Samouei, P., & Ashayeri, J. (2019). Developing optimization & robust models for a mixed-model assembly line balancing problem with semi-automated operations. Applied Mathematical Modelling, 72, 259–275. https://doi.org/10.1016/j.apm.2019.02.019 DOI: https://doi.org/10.1016/j.apm.2019.02.019
[14] Nikkerdar, M., ElMaraghy, W., & ElMaraghy, H. (2025). Smart adaptable assembly line rebalancing based on reinforcement learning. The International Journal of Advanced Manufacturing Technology, 138(9–10), 4155–4173. https://doi.org/10.1007/s00170-025-15780-9 DOI: https://doi.org/10.1007/s00170-025-15780-9
[15] Rockafellar, R. T., & Uryasev, S. (2000). Optimization of conditional value-at-risk. The Journal of Risk, 2(3), 21–41. https://doi.org/10.21314/jor.2000.038 DOI: https://doi.org/10.21314/JOR.2000.038
[16] Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4), 455–472. https://doi.org/10.1287/trsc.1050.0135 DOI: https://doi.org/10.1287/trsc.1050.0135
[17] Scholl, A. (1993). Benchmark data sets by Scholl (1993). https://assembly-line-balancing.de/salbp/benchmark-data-sets-1993/
[18] SimPy Developers. (n.d.). SimPy documentation: Overview. https://simpy.readthedocs.io/en/latest/
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Academic Journal of Science and Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
