Treffer: A new multi-objective genetic algorithm for solving the fuzzy stochastic multi-manned assembly line balancing problem.

Title:
A new multi-objective genetic algorithm for solving the fuzzy stochastic multi-manned assembly line balancing problem.
Authors:
Zacharia, Paraskevi Th.1 (AUTHOR), Nearchou, Andreas C.2 (AUTHOR) nearchou@upatras.gr
Source:
International Journal of Production Research. Dec2025, Vol. 63 Issue 24, p9879-9901. 23p.
Database:
Business Source Premier

Weitere Informationen

By incorporating the uncertainty and imprecision inherent in real-world production systems, this paper introduces the multi-manned assembly line balancing problem (MMALBP) with fuzzy stochastic task processing times. MMALBP has recently emerged as a key challenge in flow-line production systems manufacturing large-scale products (e.g. the automotive industry), where multiple workers collaborate at the same station to perform different operations simultaneously on a single product. MMALBP is a decision problem that involves partitioning assembly tasks among stations and scheduling them across multiple workers while optimising key operational objectives related to capacity and/or operational cost of the line. To enhance realism and decision-making, a new problem termed fs-MMALBP is introduced, which models task time uncertainties as fuzzy stochastic variables. The objective is to optimise three conflicting criteria: (1) minimising the number of the stations, (2) minimising the total number of the workers employed along all the stations and (3) maximising the workload smoothness across the line. Given the NP-hard nature of the problem, a new robust multi-objective genetic algorithm (MOGA) is developed to identify the Pareto-optimal set. Simulation results show that MOGA effectively produces well-distributed Pareto-optimal solutions under fuzzy-stochastic uncertainty, with improved hypervolume and competitive CPU times across benchmark instances. [ABSTRACT FROM AUTHOR]

Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Volltext ist im Gastzugang nicht verfügbar.