Multi-Objective Large-Scale ALB Considering Position and Equipment Conflicts Using an Improved NSGA-II

Abstract

On large-scale product assembly lines, such as those used in aircraft manufacturing, multiple assembly positions and devices often coexist within a single workstation, leading to complex task interactions. As a result, the problem of parallel task execution within workstations must be effectively addressed. This study focuses on positional and equipment conflicts within workstations. To manage positional and equipment conflicts, a multi-objective optimization model is developed that integrates assembly sequence planning with the first type of assembly line balancing problem. This model aims to minimize the number of workstations, balance task loads, and reduce equipment procurement costs. An improved NSGA-II algorithm is proposed by incorporating artificial immune algorithm concepts and neighborhood search. A selection strategy based on dominance rate and concentration is introduced, and crossover and mutation operators are refined to enhance search efficiency under restrictive parallel constraints. Case studies reveal that a chromosome concentration weight of about 0.6 yields superior search performance. Compared with the traditional NSGA-II algorithm, the improved version achieves the same optimal number of workstations but provides a 5% better workload balance, 2% lower cost, a 76% larger hyper-volume, and a 133% increase in Pareto front solutions. The results demonstrate that the proposed algorithm effectively handles assembly line balancing with complex parallel constraints, improving Pareto front quality and maintaining diversity. It offers an efficient, practical optimization strategy for scheduling and resource allocation in large-scale assembly systems.

1. Introduction

As one of the most representative modes of production organization in modern manufacturing, assembly lines have been extensively applied in industries such as automotive, electronics, and aerospace [1]. Owing to the high degree of specialization in labor division and collaboration, assembly lines can substantially enhance production efficiency while reducing manufacturing costs. A typical assembly line comprises a series of workstations, each responsible for designated assembly tasks [2]. These tasks are typically executed by one or more workers operating the relevant equipment in accordance with a predetermined process sequence. Upon completion, the product is transferred to the next workstation for subsequent assembly, continuing in this manner until the entire process is completed. In this context, the scientific and rational allocation of tasks to workstations directly influences assembly line efficiency, production cycle time, and both construction and operational costs [3].

The Assembly Line Balancing (ALB) problem aims to allocate assembly tasks in such a way that objectives such as minimizing the number of workstations, optimizing cycle time, or maximizing production efficiency can be achieved [4,5]. Traditional studies on ALB are often based on the following assumptions: each workstation is operated by a single worker, tasks must strictly follow the predefined precedence constraints, and no parallel tasks are allowed. Under these assumptions, research mainly focuses on optimizing task allocation under precedence constraints [6,7]. However, real-world assembly processes are usually more complex. In particular, in two-sided or multi-sided assembly line settings, although parallel tasks have been partially considered, most studies still focus primarily on precedence relationships, while constraints arising from workers, equipment, and spatial positions have not been sufficiently addressed [8].

Large-scale, complex product assembly lines, particularly those in the aerospace industry, constitute a typical ALB problem characterized by restrictive parallel constraints [9]. In such contexts, numerous tasks must be executed in parallel. A single workstation often encompasses multiple workers, specialized equipment, and several assembly positions [10]. However, tasks within the same workstation may contend for identical resources; for instance, multiple tasks may simultaneously require the same worker, the same equipment, or the same spatial location. Since a worker, a piece of equipment, or a specific position can engage in only one task at a given time, such resource conflicts substantially limit task parallelism. Consequently, the feasibility of parallel task execution is determined not only by precedence constraints but also by conflicts involving personnel, equipment, and workstation positions. If such parallel conflicts are not appropriately resolved, they may result in decreased assembly efficiency, resource wastage, and production delays [11].

Simultaneously, the construction and operation of large-scale assembly lines generally necessitate substantial investment, particularly for high-precision assembly lines that heavily depend on expensive tooling and automated or semi-automated equipment [12]. Against this backdrop, minimizing the number of workstations and reducing equipment investment costs are commonly considered primary objectives by enterprises. Furthermore, as each workstation is typically operated by a team, task allocation must also account for workload balance among teams to ensure fairness and enhance overall assembly performance while satisfying production capacity requirements [13,14].

Motivated by these considerations, this paper investigates the ALB problem for large-scale product assembly lines characterized by restrictive parallel constraints. Unlike traditional approaches that solely consider precedence relations, this study explicitly integrates conflicts associated with positions, equipment, and workers into the optimization model. The objective is to achieve cost reduction and efficiency enhancement via multi-objective optimization. To this end, an improved Non-dominated Sorting Genetic Algorithm II (NSGA-II) is proposed to optimize task allocation and assembly sequencing, thereby effectively mitigating parallel conflicts and enhancing the overall performance of the assembly line.

The remainder of this paper is organized as follows. Section 2 reviews the related literature on assembly line balancing and assembly sequence planning. Section 3 provides a detailed description of the problem. Section 4 presents the proposed improved NSGA-II algorithm. Section 5 illustrates the solution process and results through a case study. Finally, Section 6 concludes the paper and outlines future research directions.

2. Literature Review

The ALB problem has been extensively investigated, with primary objectives typically encompassing the minimization of the number of workstations under a given cycle time [15,16,17] or the minimization of the cycle time under a fixed number of workstations [18,19,20]. In addition, some studies have focused on maximizing production efficiency while minimizing costs [21,22,23].

From the perspective of constraints, ALB models are generally formulated based on factors such as cycle time, task precedence relations, workstation capacity, task attributes, and worker skills. For instance, Mukund N. J. et al. investigated the robotic ALB problem by incorporating constraints such as robot assignment, the number of tasks per robot, cycle time, and task precedence, thereby addressing the impact of task execution sequences on processing time [24]. Junior P. C. M. et al. proposed an exact constraint programming (CP) method capable of handling a wide range of real-world constraints and formulated a general and unified model [25]. Abdous A. M. et al. introduced a scenario-based optimization model that integrates task time variability and its associated probabilities across different scenarios to mitigate worker fatigue [26]. Huang Y. Z. formulated a mixed-integer programming model to address ALB problems with multiple constraints, including setup time, positional restrictions, zoning limitations, and synchronization requirements [27]. Amir N. et al. proposed a constraint programming model to address practical issues such as varying skill levels of workers and robots, energy requirements, tool changes, and spatial zoning [28].

Classical ALB research predominantly assumes that tasks within a workstation are executed sequentially, whereas the introduction of parallel tasks substantially increases problem complexity. In recent years, researchers have increasingly focused on parallel assembly line balancing (Parallel ALB), emphasizing task allocation and worker collaboration to enhance workstation utilization [29,30,31,32,33]. However, existing studies primarily address scenarios with unrestricted parallelism, whereas research on parallel tasks under constraints such as limited space and equipment remains relatively scarce. As the number of parallel tasks increases, the complexity of resource allocation within workstations intensifies, and more stringent requirements are imposed on assembly sequence planning.

Assembly sequence planning (ASP) seeks to improve the efficiency and stability of the assembly process by systematically determining the order in which components are assembled. With respect to constraints, ASP models typically consider both physical limitations—such as geometric feasibility and tool availability—and logical constraints, including precedence relations and process requirements [34,35,36,37]. From an algorithmic perspective, intelligent optimization techniques such as genetic algorithms, particle swarm optimization, and ant colony optimization have been widely employed to address ASP problems.

For instance, Zhao R. H. et al. [38] proposed a synergistic optimizer, termed the “Self-Learning Reinforced Multi-guided Genetic and Differential Evolution Operator (SL-MGDO),” to address multi-objective and multi-constraint human–robot collaborative assembly tasks, thereby effectively handling the complexity of task planning. Hwai-E T. et al. [39] applied genetic algorithms to ASP optimization, elaborating on the design of genetic operators and the formulation of fitness functions. Wan X. et al. [40] enhanced the traditional genetic algorithm to mitigate its tendency to fall into local optima, thereby enabling global search under machining constraints and obtaining the optimal assembly sequence. Sheng Z. Y. et al. [41] proposed a symbiotic organisms search (SOS) algorithm that integrates robotic kinematics analysis with diversification strategies, thereby satisfying the requirements of efficiency and stability in space missions. Keijiro W. et al. [42] employed an improved Q-learning search algorithm that explores assembly sequences through reinforcement learning and trial-and-error, thus eliminating the need for detailed pre-investigation of product structures required in earlier studies.

In recent years, several studies have sought to integrate ALB with ASP for joint optimization. For example, Rashid A. F. F. M. et al. formulated the objectives of minimizing tool orientation changes and tool substitutions in ASP, as well as reducing production cycle time, the number of workstations, and workload variation in ALB [43]. Under the constraints of maximum workstation cycle time and operation precedence, they employed an improved artificial bee colony algorithm to achieve joint optimization. Subsequently, Rashid A. F. F. M. et al. incorporated task similarity and operation precedence as constraints, and devised a multi-objective discrete particle swarm optimization approach with minor solution adjustments to attain optimal or near-optimal performance [44]. Abdolmajid Y. et al. proposed a hybrid genetic algorithm to jointly address ALB and ASP, explicitly considering the impact of task execution order on processing time [45]. Their approach reduced assembly line idle time and enhanced production efficiency through rational task allocation and sequencing. Gunji B. M. et al. reformulated ASP as a discrete optimization problem and applied an improved cuckoo search algorithm to shorten planning time, alleviate bottleneck operations, and enhance ALB performance [46]. S. Ehsan Hashemi P. et al. adopted an “adversarial approach” to assembly line design, employing local search to generate product sequences and achieve dynamic task allocation, thereby overcoming the scalability limitations of mixed-integer linear programming models [47]. Nevertheless, most existing studies have primarily concentrated on integrating the objectives and conventional constraints of ALB and ASP, whereas limited attention has been devoted to more complex scenarios involving restrictive parallel constraints, assembly costs, and positional conflicts. Ramezanian R. et al. introduced the Imperialist Competitive Algorithm and Genetic Algorithm into ALB to enhance the effectiveness of multi-product supply chain network design and assembly line balancing [48]. Nowicki E. et al. applied the Tabu Search Algorithm to minimize the makespan in job shop scheduling [49].

The main contributions of this study are summarized as follows:

• Modeling restrictive parallel constraints: This study explicitly incorporates restrictive parallel constraints, including conflicts associated with workers, equipment, and assembly positions, thereby providing a more realistic representation of large-scale product assembly lines.
• Multi-objective optimization framework: A multi-objective model is formulated with the aims of minimizing the number of workstations, reducing equipment investment costs, and balancing workloads among teams, thereby aligning with practical industrial needs.
• Improved NSGA-II algorithm: An enhanced version of the NSGA-II is developed to solve the proposed model, enabling efficient handling of complex constraints and improvement of solution quality.
• Case study validation: The effectiveness and superiority of the proposed approach are validated through a real-world-inspired case study, demonstrating its potential to reduce costs and enhance production efficiency in large-scale product assembly.

In summary, existing research on the integration of ALB and ASP remains limited, particularly in the context of flow-line design for large-scale products subject to restrictive constraints. In studies addressing multi-operator workstations, practical issues such as positional conflicts and equipment interference have likewise received limited attention. Therefore, this study addresses the challenge of parallel constraints in real-world production by explicitly considering factors such as positional and equipment conflicts. By systematically integrating ALB and ASP, this study investigates assembly line balancing under restrictive parallel constraints, aiming to enhance the design efficiency of assembly lines for large-scale products.

3. Problem Description

3.1. Restrictive Parallel Constraints and Balance Objectives

For the ALB problem of large-scale products with restrictive parallel constraints, this study considers not only conventional constraints, such as production takt time and task precedence, but also emphasizes two types of restrictive parallel constraints: position conflicts and equipment conflicts. Incorporating these constraints enables the assembly line balancing scheme to more accurately reflect real production conditions, preventing interruptions or efficiency losses caused by position or equipment conflicts, thereby enhancing the feasibility, stability, and overall production efficiency of the assembly line.

(1) Equipment Conflicts

In parallel assembly tasks of large-scale products, equipment conflicts are both complex and critical. Such assembly operations often necessitate dedicated tooling or specialized equipment. Due to the presence of multiple assembly positions within a workstation and considerable distances between them, sharing equipment across positions is often infeasible. Consequently, in most cases, each assembly position must be provided with the necessary tools and equipment to accomplish its tasks. For large-scale products with high precision or complex assembly processes (e.g., aircraft assembly), certain equipment may entail substantial single-unit procurement costs. As a result, typically only a single unit of the relevant equipment is installed in a workstation, with devices such as rails employed to perform tasks across multiple positions. Consequently, even when task precedence permits parallel execution, tasks requiring the same limited equipment must still be executed sequentially, as shown in Figure 1a.

(2) Position Conflicts

Although large-scale product assembly can accommodate multiple workers performing parallel tasks simultaneously, spatial limitations constrain the number of workers able to operate concurrently. This implies that even if tasks can theoretically be executed in parallel according to task precedence, they cannot run concurrently when requiring the same position, resulting in position conflicts. The aforementioned restrictive parallel constraints are prevalent in large-scale product assembly, particularly within the aerospace industry. Other constraints, including task posture conflicts and personnel skill conflicts, may also be addressed using analogous methods. This study primarily focuses on equipment and position conflicts in assembly line balancing, making it particularly suitable for the design of new production lines. The approach begins with production capacity requirements, derives the corresponding takt time, and conducts assembly line balancing under the specified takt, as shown in Figure 1b.

Figure 1. Conflict illustrations. (a) Equipment Conflicts; (b) Position Conflicts.

Figure 1. Conflict illustrations. (a) Equipment Conflicts; (b) Position Conflicts.

Based on the characteristics of large-scale product assembly lines, this study aims to optimize three primary objectives:

(1) Minimizing the Number of Workstations

This represents a conventional objective in assembly line balancing and is particularly critical for large-scale products. Workstations for large products occupy substantial space; for instance, assembling a small fixed-wing UAV may necessitate approximately 15 m × 10 m. More complex products, such as fighter jets or transport aircraft, demand even larger areas. Excessive workstations reduce factory space utilization, increase logistics costs, and complicate management; hence, minimizing the number of workstations is essential.

(2) Balancing Workload Among Workstations

For assembly lines with numerous parallel tasks, each workstation is typically staffed by a team of workers. Production output is initially allocated among workstations and subsequently distributed within the team according to individual task assignments. Therefore, balancing workloads among workstations is critical for efficient line operation and effective performance management.

(3) Minimizing Equipment Procurement Costs

Large-scale product assembly, particularly in aerospace, necessitates high-precision equipment, which is frequently costly. For example, an automated riveting and drilling machine may cost up to 70 million RMB. If equipment cannot be relocated or shared, multiple units may be required for different positions within the same workstation; if the equipment is movable, only a single unit is needed per workstation. Since equipment is generally non-shareable across workstations, assembly line balancing significantly impacts equipment procurement costs.

These three objectives collectively contribute to optimizing the cost and efficiency of large-scale product assembly lines. Other objectives, such as maximizing personnel utilization, may also be considered; however, they fall beyond the scope of this study, as they involve personnel assignment.

3.2. Assumptions

The following assumptions are made concerning ALB with restrictive parallel constraints:

• The assembly line produces only a single type of product.
• The assembly line has a known and predetermined takt time requirement.
• The precedence relationships among tasks are known.
• The workstation positions and the equipment required for each assembly task are known.
• The processing time for each assembly task is predetermined and independent of the assigned workstation.
• Each workstation position or piece of equipment can perform only one task at a time.
• Workstations are arranged in series, and no parallel workstations are considered.
• Parallel tasks within the same workstation are scheduled as early as possible to maximize the number of tasks that can be executed within the workstation.

3.3. Notation and Variables Used in the Proposed Model

The notations and variables commonly used in the proposed model are summarized in

Table 1. Notation used in the proposed model.

Symbol	Description
$V$	Set of all tasks, $V=\left\{1,2,\dots ,n\right\}$.
$CT$	Takt time.
$t_i$	Duration-time for task $i$.
$K$	Set of all workstations.
$N$	Total number of workstations, $N=\left|K\right|$.
$C_j$	Purchase price of one device $j$.
$N_s$	Number of devices $s$ required for the entire assembly line.
$P$	Set of all assembly positions.
$S_F$	Set of fixed device types used in the entire assembly line.
$S_M$	Set of movable device types used in the entire assembly line.
$S$	Set of all device types used in the entire assembly line, $S=S_F\cup S_M$.
$Pre{d}_i$	Set of immediate predecessor tasks for task $i$.
$T_k$	Cycle time of the $k$-th workstation
$T{T}_k$	Total duration time of all tasks at the $k$-th workstation
$R_k$	Set of tasks in the $k$-th workstation, $R_k=\left\{i\left|x_{ik}=1,i=1,2,\dots ,n\right.\right\}$
$A_k$	0 or 1 parameter. 1 indicates that at least one task has been assigned to the $k$-th workstation, otherwise it is 0
$S_{jk}$	0 or 1 parameter. 1 means that the $k$-th workstation uses the mobile device $j$, otherwise it is 0.
$V{M}_j$	Set of tasks using mobile device $j$.
$V{F}_{\mathrm{s}}$	Set of tasks using fixed device $s$
$po{s}_{ip}$	0 or 1 parameter. 1 indicates that task $i$ uses position $p$, otherwise it is 0.
$e{q}_{is}$	0 or 1 parameter. 1 indicates that task $i$ uses device $s$, otherwise it is 0.
$E_s$	Number of tasks using device $s$.
$H_i$	Set of tasks that are in the same workstation as task $i$ and have conflicts with task $i$ in terms of position, $H_i=\left\{j\left|po{s}_{jp}=po{s}_{ip}\begin{array}{c}and\end{array}{x}_{jk}=x_{ik},j\in V,p\in P,k\in K\right.\right\}$.
$D_i$	Set of tasks that are in the same workstation as task $i$ and have conflicts with task $i$ in terms of devices, $D_i=\left\{j\left|e{q}_{js}=e{q}_{is}\begin{array}{c}and\end{array}{x}_{jk}=x_{ik},j\in V,s\in S_M,k\in K\right.\right\}$.
$M$	A sufficiently large constant.
$po{s}_{kps}$	0 or 1 parameter. If there is a task using fixed device $s$ at position $p$ in the $k$-th workstation, it is 1, otherwise it is 0.
$N_{sk}$	Number of fixed devices $s$ required for the $k$-th workstation.
$V_{\mathrm{kp}}$	Set of tasks assigned to position $p$ of the $k$-th workstation.
$W_l$	Task with the minimum end-time.
$W_i$	Task corresponding to the $i$-th gene locus in the chromosome.
$Q_k$	Set of assigned tasks for workstation $k$.
$T_{W_i}$	Set of tasks that have parallel conflicts with $W_i$ in current workstation.

.

Table 2. Variables used in the proposed model.

Symbol	Description
$s{t}_i$	Start-time for task $i$.
$e{t}_i$	End-time for task $i$.
$x_{ik}$	0 or 1 variable. 1 indicates that task $i$ is assigned to the $k$-th workstation, otherwise it is 0.
$y_{ij}$	0 or 1 variable. 1 indicates that task $i$ is executed before task $j$, otherwise it is 0.

presents the decision variables employed in the proposed model.

3.4. Mathematical Model

Based on the constraints and objectives outlined in this study, the mathematical model for ALB is formulated as follows:

$$Minimize\hspace{1em}obj1={\displaystyle \sum _{\mathrm{k}\in \mathrm{K}}{A}_k},$$

(1)

$$Minimize\hspace{1em}obj2=1-{\displaystyle \frac{{\displaystyle \sum _{i=1}^n{t}_i}}{N*\underset{k\in K}{Max}\left\{T{T}_k\right\}}},$$

(2)

$$Minimize\hspace{1em}obj3={\displaystyle \sum _{j\in S}{C}_j{N}_j},$$

(3)

$${\displaystyle \sum _{k\in K}{x}_{ik}=1},\forall k\in K,$$

(4)

$${\displaystyle \sum _{i=1}^n{x}_{ik}\le n{A}_k},\forall k\in K,$$

(5)

$${\displaystyle \sum _{k\in K}(k{x}_{ik}-k{x}_{jk})\ge 0},(\forall i\in V,j\in Pre{d}_i),$$

(6)

$$s{t}_i\le s{t}_j+M(1-y_{ij})-t_i,\forall i\in V,j\in (H_i\cup D_i),$$

(7)

$$s{t}_i\ge s{t}_j-M\cdot y_{ij}+t_j,\forall i\in V,j\in (H_i\cup D_i),$$

(8)

$$e{t}_i=s{t}_i+t_i,\forall i\in V,$$

(9)

$$T_k=\max \left\{e{t}_i\left|i\in R_k\right.\right\},\forall k\in K,$$

(10)

$$T_k\le CT,\forall k\in K,$$

(11)

$$T{T}_k={\displaystyle \sum _{i\in R_k}{t}_i},\forall k\in K,$$

(12)

$$E_s={\displaystyle \sum _{i=1}^{n}e{q}_{is}},\forall s\in S,$$

(13)

$${\displaystyle \sum _{i\in V{M}_j}{x}_{ik}\le E_j{S}_{jk},}\forall j\in S_M,k\in K,$$

(14)

$$N_j={\displaystyle \sum _{k\in K}{S}_{jk}},\forall j\in S_M,$$

(15)

$${\displaystyle \sum _{i\in V{F}_s}{x}_{ik}\cdot po{s}_{ip}}\le E_s\cdot po{s}_{kps},\forall k\in K,p\in P,s\in S_F,$$

(16)

$$N_{sk}={\displaystyle \sum _{p\in P}po{s}_{kps}},\forall s\in S_F,k\in K,$$

(17)

$$N_j={\displaystyle \sum _{k\in K}{N}_{jk}},\forall j\in S_F.$$

(18)

Equations (1)–(3) define the objective functions of the model, which correspond to minimizing the number of workstations, achieving the most balanced workload distribution across workstations, and minimizing the total cost of equipment procurement, respectively. Equations (4)–(18) specify the constraints of the model. Equation (4) ensures that each task is assigned to exactly one workstation. Equation (5) requires that each workstation be assigned at least one task. Equation (6) enforces that task assignments adhere to precedence constraints. Equations (7) and (8) state that if two tasks within the same workstation conflict in terms of position or equipment usage, they cannot be executed in parallel. Equation (9) specifies the end-time constraint for each task. Equation (10) imposes the cycle time constraint for the $k$-th workstation. Equation (11) imposes the takt time constraint, requiring that the cycle time of any workstation must not exceed the takt time. Equation (12) defines the workload of a workstation as the sum of the processing times of all tasks assigned to it. Equation (13) specifies the total number of tasks that utilize a particular device across the assembly line. Equation (14) ensures that if the $k$-th workstation includes a task requiring a movable device $j$, then one unit of device $j$ must be allocated to that workstation. Equation (15) calculates the total number of movable devices $j$ across the assembly line as the sum of devices allocated to each workstation. Equation (16) requires that if a task at a specific position in a workstation utilizes a fixed device $s$, then that position must be equipped with device $s$. Equations (17) and (18) determine the total number of fixed devices $s$ required for each workstation and for the entire assembly line, respectively.

3.5. ASP Methods Within the Workstation

Due to the presence of numerous parallel tasks as well as position and device conflicts within the workstation, ASP must be considered in the ALB model proposed herein. It is necessary to determine which tasks can be parallelized and the appropriate initiation time for parallelization. This has a significant impact on attaining line balance, as shown in Figure 2.

ASP itself has numerous optimization objectives and constitutes an NP-hard problem. Based on the balance objective proposed in Section 3.1 and to simplify the calculation, this study proposes the parallel task processing principle of “parallelize as soon as possible if feasible” at the workstation level. Although this principle may not be optimal for ASP, it is advantageous for attaining ALB objectives, and there remains scope for further ASP optimization at the workstation level after assembly line balancing:

(1)

The parallel task processing principle of “parallelize as soon as possible if feasible” ensures that the initiation time of parallel tasks at the workstation is advanced to the earliest feasible point. This approach partially reduces the workstation cycle time and ensures that the workstation can accommodate as many tasks as possible under the given task assignment sequence, thereby minimizing the number of workstations and device procurement costs.

(2)

After the assembly line is balanced, the cycle time of the bottleneck workstation serves as the workstation cycle time constraint, while other workstations retain some idle capacity. When considering the goals of balancing workload within and between workstations, there remains potential for further optimization in ASP, which can also be addressed through worker reallocation across workstations. These optimizations do not affect the attainment of the balance objective in this study. Therefore, this study focuses on ALB, and it is appropriate to adhere to the parallel task processing principle of “parallelize as early as feasible” in ASP.

4. Improved NSGA-II Algorithm

4.1. NSGA-II Algorithm

The NSGA-II algorithm is a widely adopted meta-heuristic method for solving multi-objective optimization problems [50,51]. Due to the complex assembly processes and numerous tasks of large-scale products, the resulting chromosome representation tends to be lengthy. To enhance algorithmic efficiency, drawing upon the principles of the artificial immune algorithm [52] and the neighborhood search algorithm [53], this study improves the traditional NSGA-II algorithm from two perspectives: initial population generation and genetic operator design. By introducing affinity-based selection and neighborhood search mechanisms, the local and global refinement capabilities of the genetic algorithm are enhanced. This effectively alleviates the tendency of the NSGA-II algorithm to become trapped in local optima when dealing with lengthy chromosomes.

4.2. Chromosome Coding

This study adopts an integer encoding method, wherein integers serve as the gene values of chromosomes, and each gene value uniquely corresponds to a task on the assembly line. The ordering of tasks within a chromosome represents the task assignment sequence. For example, the chromosome “1 2 3 4 5 6 7 8 9” represents a sequence of integers ranging from 1 to 9, where each integer uniquely corresponds to a task and occurs only once within the chromosome, thereby ensuring that each task is assigned exactly once. The ordering of this chromosome directly reflects the task assignment sequence, namely, task 1 is assigned first, followed sequentially by tasks 2 through 9.

4.3. Chromosome Decoding

(1) Feasibility Testing and Repair of Chromosomes

Owing to precedence constraints in assembly, infeasible task assignment sequences may arise during chromosome generation and genetic operator operations. This study employs the following procedures to conduct feasibility testing and repair of infeasible chromosomes:

• Step 1: Starting from the first gene, check whether the corresponding task is assignable (a task is assignable when all its immediate predecessors have been assigned). If it is, mark the task as assigned and proceed to Step 2; otherwise, skip the gene and examine the next one until a feasible task is identified, then mark it as assigned and proceed to Step 2.
• Step 2: Insert the task corresponding to the gene into the last position of the new chromosome. If there are tasks preceding it, shift them forward by one position and proceed to Step 3.
• Step 3: Delete the gene from the original chromosome and shift subsequent genes forward by one position. Repeat Steps 1–3 until all genes in the original chromosome have been deleted, then proceed to Step 4.
• Step 4: Replace the original chromosome with the newly formed one to complete feasibility testing and repair.

(2) Decoding of Chromosomes

The decoding process entails sequentially assigning tasks according to the gene sequence of the chromosome. Depending on whether positional or device conflicts exist between the task being assigned and those already allocated to the current workstation, and whether the production takt time constraint is violated, it is determined whether the current task should be assigned to the current workstation or to a newly initiated workstation. Simultaneously, the initiation time of the task within the current workstation is established. By continuously repeating these task assignment steps until all tasks are allocated, the full task assignment corresponding to the chromosome is ultimately derived.

For assembly lines with numerous restrictive parallel tasks, the decoding process must determine the feasible parallelization of tasks. In accordance with the objective outlined in this study, the initiation time of a parallel task is determined using the method presented in Section 3.5. The decoding procedure proceeds as follows, where $W_i$ denotes the task associated with the $i$-th gene position:

• Step 1: Initialization. Let $i=0$, $Q_k=\phi$, $k=1$; initialize the first workstation of the assembly line, and proceed to Step 2 ($Q_k$ is the set of tasks assigned to the $k$-th workstation,$\phi$ is an empty set).
• Step 2: Initialize $i=i+1$, indicating preparation to handle the corresponding task in the first gene sequence, and proceed to Step 3.
• Step 3: Determine whether is $Q_k\cap Pre{d}_{W_i}=\phi$ true. If it is, proceed to Step 4; otherwise, proceed to Step 11.
• Step 4: Because $Q_k\cap Pre{d}_{W_i}=\phi$, it indicates the absence of an immediate predecessor task of $i$ in the currently assigned tasks within the $k$-th workstation. Initialize $s{t}_{W_i}\prime =0$, $T_{W_i}=(H_{W_i}\cup D_{W_i})\cap Q_k$, turn to Step 5.
• Step 5: Determine whether $s{t}_{W_i}\prime +t_{W_i}\le CT$ is true. If it is, proceed to Step 6; otherwise, proceed to Step 10.
• Step 6: Determine whether $T_{W_i}$ is empty. If it is, proceed to Step 8; otherwise, proceed to Step 7.
• Step 7: Determine whether $s{t}_{W_i}\prime +t_{W_i}\le min(s{t}_{W_l})$ is true, where $W_l\in T_{W_i}$. If it is, proceed to Step 8; otherwise, proceed to Step 9.
• Step 8: Initialize $s{t}_{W_i}=s{t}_{W_i}\prime$, $Q_k=Q_k\cup W_i$, turn to Step 17.
• Step 9: Find the task $W_l$ with the minimum end-time and its corresponding end-time in $T_{W_i}$, denote them as $W_l$ and , respectively, let $s{t}_{W_i}\prime =e{t}_{W_l}$, and remove $W_l$ from $T_{W_i}$. Then turn to Step 5.
• Step 10: Initialize $k=k+1$; initialize the subsequent workstation. Proceed to Step 3.
• Step 11: Initialize $s{t}_{W_i}\prime =max(e{t}_{W_j})$, $W_j\in (Q_k\cap Pre{d}_{W_i})$, turn to Step 12.
• Step 12: Initialize $T_{W_i}=(H_{W_i}\cup D_{W_i})\cap Q_k$, turn to Step 13.
• Step 13: Determine whether $s{t}_{W_i}\prime +t_{W_i}\le CT$ is true. If it is, proceed to Step 14; otherwise, proceed to Step 10.
• Step 14: Remove tasks $W_l$ with end-time less than $s{t}_{W_i}\prime$ in $T_{W_i}$, then proceed to Step 15.
• Step 15: Determine whether $T_{W_i}$ is empty. If it is, proceed to Step 8; otherwise, proceed to Step 16.
• Step 16: Determine whether $s{t}_{W_i}\prime +t_{W_i}\le min(s{t}_{W_l})$ is true, where $W_l\in T_{W_i}$. If it is, proceed to Step 8; otherwise, proceed to Step 17.
• Step 17: Find the task $W_l$ with the minimum end-time in $T_{W_i}$, let $s{t}_{W_i}\prime =e{t}_{W_l}$, and remove $W_l$ from $T_{W_i}$. Then turn to Step 13.
• Step 18: Verify whether all tasks have been assigned. If so, proceed to Step 19; otherwise, return to Step 2.
• Step 19: Output the final task assignment results.

The detailed flowchart illustrating the decoding steps is presented in Figure 3.

4.4. Population Initialization

In the NSGA-II algorithm, chromosomes within the initial population are typically generated randomly. However, the task priority sequence imposes constraints on their positions within each chromosome, so randomly generated chromosomes frequently produce infeasible solutions. Therefore, to ensure the feasibility of the initial chromosomes, minimize the chromosome repair workload, and preserve population diversity, this study proposes the following procedure for generating the initial population:

• Step 1: Construct the task precedence relationship matrix. Based on the precedence relationships among tasks, define the relationship matrix $PR$ such that if task $i$ is the immediate predecessor of task $j$, then $P{R}_{ij}=1$, otherwise, $P{R}_{ij}=0$.
• Step 2: Initialize $i=1$.
• Step 3: Randomly select a task from the set of tasks whose corresponding column sum in the matrix $PR$ equals 0, and assign it to the $i$-th gene position of the chromosome. Remove the corresponding row and column of this task from matrix $PR$, update $PR$ accordingly, and increment $i$ by 1.
• Step 4: Repeat Step 3 until matrix $PR$ becomes empty, thereby forming a feasible chromosome.
• Step 5: Repeat Steps 2–4 until the entire initial population is generated.

The flowchart of population initialization is shown in Figure 4.

4.5. Genetic Operators

4.5.1. Selection Operator

To ensure algorithmic convergence, this study constructs a separate elite pool and selects chromosomes according to an elite retention strategy. To balance global and local search and enhance search efficiency, this study does not employ the hierarchical selection strategy of the NSGA-II algorithm, which relies on crowding distance and hierarchical ranking. Instead, this strategy applies crowding-based selection only at the final layer that satisfies the population size requirement. For long chromosomes and large-scale populations, this strategy may fail to maintain population diversity during early iterations and is prone to convergence to local optima. Therefore, this study proposes an affinity-based selection strategy, which preserves population diversity during early iterations while promoting population convergence in later iterations.

(1)

Elite Pool Update: Identify chromosomes on the Pareto front in the current population, merge them with the existing elite pool, and select the Pareto-optimal chromosomes from the merged set. Add these selected chromosomes to the elite pool and remove others to complete the update.

(2)

Population Update: Inspired by the artificial immune algorithm [54], population updates are performed based on affinity. The affinity of a chromosome $x$ is defined as a function of its dominance rate and concentration:

$$aff(x)=\lambda {\displaystyle \frac{1}{1.0+c(x)}}+(1-\lambda )\rho (x),$$

(19)

where $c(x)$ is the dominance rate of the chromosome $x$, $\rho (x)$ is the concentration of the chromosome $x$, and $\lambda$ is a variable weight coefficient that ensures that the concentration effect gradually decreases as the iteration progresses, its maximum and minimum values are limited to ${\lambda }_{max}$ and ${\lambda }_{min}$, respectively. The above variables are calculated by the following formulas:

$$c(x)={\displaystyle \frac{\left|\left.\left\{\left.y\right|y<x,\forall y\in X\right\}\right|\right.}{\left|\left.X\right|\right.}},$$

(20)

$$\rho (x)={\displaystyle \frac{\underset{\forall y\in X}{mind}(x,y)}{\underset{\forall y,z\in X}{max}d(y,z)}},$$

(21)

$$\lambda ={\lambda }_{max}-({\lambda }_{max}-{\lambda }_{min})/n,$$

(22)

where $y<x$ indicates individual $y$ dominating individual $x$, $\left|X\right|$ indicates the number of individuals in the population, $d(x,y)$ indicates the Euclidean distance between the objective functions of chromosome $x$ and $y$, and $n$ is the current iteration algebra. To eliminate the influence of dimensionality, $d(x,y)$ is calculated by the following formula:

$$d(x,y)=\sqrt{{\displaystyle \sum _{i=1}^m{d}_i(x,y)}},$$

(23)

$$d_i(x,y)=\left\{\begin{array}{l}{\displaystyle \frac{{(f_{ix}-f_{iy})}^2}{\underset{\forall x_1,x_2\in X}{max}{(f_{i{x}_1}-f_{i{x}_2})}^2}},\underset{\forall x_1,x_2\in X}{max}{(f_{i{x}_1}-f_{i{x}_2})}^2>0\\ \\ \\ 0,\underset{\forall x_1,x_2\in X}{max}{(f_{i{x}_1}-f_{i{x}_2})}^2=0\end{array}\right.,i=1,2,\dots ,m,$$

(24)

where $m$ denotes the number of objectives, $f_{ix}$ represents the objective function value of chromosome $x$ on the $i$-th objective, and $X$ denotes the chromosome population.

The selection process adopts the binary tournament method: two individuals are randomly chosen from the population, and their affinity values are compared. The individual with the higher affinity value is retained for subsequent operations, while both individuals are returned to the original population. If their affinity values are equal, one is randomly selected. This selection and comparison process is repeated until a sufficient number of individuals are obtained to construct the next-generation population.

4.5.2. Crossover Operator

To enhance search efficiency, this study designs two crossover operators, and the optimal crossover result is determined by comparing their outcomes.

(1)

Crossover Based on Sequence Features. This operator inherits the sequence features of the crossover fragments from the parent generation while ensuring the feasibility of the task assignment sequence after crossover. Consequently, no chromosome repair is required, which substantially reduces the algorithm’s computational workload. The specific crossover process is illustrated in Figure 5.

Two identical crossover positions are randomly selected in Parent 1 and Parent 2, dividing each parent into three segments: head, middle, and tail. To construct offspring Child 1, the head and tail of Parent 1 are directly inherited while preserving the original task sequence. The middle segment is reassigned internally according to the task assignment sequence of Parent 2. Offspring Child 2 is obtained in a similar manner. This crossover method retains the sequence features of the parental crossover segment while ensuring the feasibility of the chromosome task assignment sequence. However, when a large number of parallel tasks are present, the solution quality after crossover often remains unchanged, thereby diminishing the significance of crossover.

(2)

Crossover Based on Full Preservation of Crossover Segments. In this method, the offspring fully retain the parental crossover segment, although the positions of the segment and other genes may vary. This operator is capable of inheriting validated, effective local structures from the parent individual. The specific crossover process is illustrated in Figure 6.

After selecting the crossover point, the corresponding middle segments of the parent chromosomes are exchanged. If repetitive tasks occur between the head or tail segments and the exchanged middle segment, these are replaced according to the mapping relationship between the tasks in the middle segments of the two parent chromosomes. If the chromosome resulting from crossover is infeasible, the crossover segment (middle segment) is treated as an indivisible unit for repair. The specific repair process is described in Section 4.3. This crossover pattern effectively preserves gene adjacency relationships, which is critical for maintaining high-quality patterns.

The two crossover methods employ different mechanisms for preserving crossover segments, and the resulting solutions may also differ. To improve iteration efficiency, the offspring generated by the two crossover methods are compared based on their objective function values. The non-dominated solution is selected as the effective offspring; if no dominant relationship exists between the offspring, the final effective offspring is determined through random selection.

4.5.3. Mutation Operator

To ensure mutation quality, this study employs a neighborhood search-based mutation strategy.

(1) Feasible mutation space of task $i$

To maintain chromosome feasibility, the feasible mutation space of task $i$ is defined by the maximum position of all immediate predecessor tasks and the minimum position of all immediate successor tasks. An illustrative example of a feasible mutation space is provided in Figure 7.

Assume that task 4 is selected for mutation. Tasks 5 and 1 are its immediate predecessors, while tasks 7 and 9 are its immediate successors. The interval between the positions of tasks 1 and 7 defines the feasible mutation space of task 4.

(2) Mutation method

Given the presence of numerous parallel tasks, and to maximize changes in the objective values after decoding the mutated chromosome, this study adopts the long-distance mutation method. Specifically, the point within the feasible mutation space farthest from the original position of the task is selected, and insertion-based mutation is performed. For example, in Figure 7, task 4 is inserted between task 1 and task 3.

(3) Mutation neighborhood search

To further enhance mutation quality, this study applies neighborhood search. The mutation neighborhood of task $i$ is defined as the space beyond the farthest point within the feasible mutation space. Considering computational cost, the maximum number of neighborhood searches is limited to five. The method for selecting the optimal chromosome after mutation is consistent with that used for crossover.

4.6. Iteration Termination Conditions

The algorithm terminates when the maximum number of iterations is reached. Additionally, if more than 90% of individuals in the elite pool recur over 10 consecutive generations, the algorithm is also terminated.

5. Case Study

5.1. Case Introduction

To evaluate the effectiveness of the proposed model and algorithm, this study compares the improved NSGA-II with the traditional NSGA-II using a practical case. The case concerns the assembly line of an aviation manufacturing enterprise, with a designed takt time of 20 h and a total of 50 tasks. The task priority sequence is illustrated in Figure 8.

The product requires five assembly positions, which do not interfere with each other. A total of eight types of devices are required: seven are fixed within the assembly positions and cannot be moved, while the remaining one is movable and can be used across multiple assembly positions. The task details are provided in

Table 3. Basic task information.

Task	Task Position	Device Required	Device Property	Device Cost (Yuan)	Duration Time (Hours)	Task	Task Position	Device Required	Device Property	Device Cost (Yuan)	Duration Time (Hours)
1	p1	A	fixed	5000	3	26	p1	A	fixed	5000	2
2	p2	B	fixed	3000	2	27	p1	B	fixed	3000	3
3	p3	B	fixed	3000	2	28	p1	E	fixed	2000	1
4	p2	C	fixed	1500	1	29	p4	H	fixed	1500	5
5	p3	C	fixed	1500	1	30	p5	D	fixed	4000	3
6	p1	D	fixed	4000	4	31	p2	H	fixed	1500	2
7	p1	E	fixed	2000	2	32	p3	H	fixed	1500	2
8	p2	F	fixed	1000	3	33	p2	None	-	0	3
9	p3	F	fixed	1000	3	34	p3	None	-	0	3
10	p4	G	movable	60,000	2	35	p5	F	fixed	1000	3
11	p2	G	movable	60,000	3	36	p5	C	fixed	1500	1
12	p3	G	movable	60,000	3	37	p4	G	movable	60,000	4
13	p2	H	fixed	1500	1	38	p1	E	fixed	2000	2
14	p3	H	fixed	1500	1	39	p2	None	-	0	1
15	p5	A	fixed	5000	5	40	p3	None	-	0	1
16	p5	D	fixed	4000	4	41	p4	H	fixed	1500	5
17	p2	B	fixed	3000	2	42	p4	D	fixed	4000	2
18	p3	B	fixed	3000	2	43	p2	B	fixed	3000	2
19	p4	C	fixed	1500	3	44	p3	B	fixed	3000	2
20	p5	E	fixed	2000	2	45	p5	None	-	0	3
21	p5	G	movable	60,000	3	46	p5	None	-	0	1
22	p2	F	fixed	1000	4	47	p5	None	-	0	1
23	p3	F	fixed	1000	4	48	p1	A	fixed	5000	2
24	p2	C	fixed	1500	2	49	p1	F	fixed	1000	3
25	p3	C	fixed	1500	2	50	p1	E	fixed	2000	2

.

5.2. Calculation Results

The calculations were performed on a computer equipped with an Intel i7-1365HX processor and 24 GB of RAM. The minimum value of parameter $\lambda$ was set to 0.6 and the maximum to 1. The crossover probability was set to 0.9, the mutation probability to 0.3, the population size to 150, and the maximum number of iterations to 100. The parameters of the NSGA-II algorithm were selected based on previous literature and further refined through empirical tuning and preliminary optimization experiments to ensure robust convergence and solution diversity.

Figure 9 presents the Pareto front solutions obtained by running both the improved NSGA-II algorithm and the traditional NSGA-II algorithm in MATLAB R2021b (as shown in the Appendix A). Since the number of workstations corresponding to the Pareto front solutions obtained by both algorithms is identical (three stations), for clarity, only a comparison of solutions on the two-dimensional Pareto front formed by the remaining two objectives is presented. The figure clearly shows that the improved NSGA-II algorithm demonstrates superior overall performance. Specifically, the improved NSGA-II algorithm yields a greater number of frontier solutions, a more uniform distribution, and higher-quality outcomes.

From the perspective of workload balance rate, the quality of the single-objective optimal solution on the Pareto front obtained by the improved NSGA-II algorithm is superior to that of the traditional NSGA-II algorithm. Figure 10 presents the task allocation schemes corresponding to the single-objective optimal solutions on each Pareto front for the two algorithms, while

Table 4. Comparison of Workload between Traditional NSGAII and Improved NSGAII Algorithm.

Workstation	Traditional NSGA-II Algorithm Workload (Hours)	Improved NSGA-II Algorithm Workload (Hours)
Workstation 1	43	41
Workstation 2	43	41
Workstation 3	37	41

reports the task load statistics of the corresponding solutions. These results indicate that the improved algorithm offers significant advantages.

From the perspective of equipment procurement costs, the quality of the single-objective optimal solution on the Pareto front obtained by the traditional NSGA-II algorithm is also superior to that obtained by the improved NSGA-II algorithm. Figure 11 presents the task plans corresponding to the single-objective optimal solutions on each Pareto front of the two algorithms, while

Table 5. Comparison of Cost between Traditional NSGAII and Improved NSGAII Algorithm.

Algorithm	Workstation	Number of Devices								Cost (Yuan)
		A	B	C	D	E	F	G	H
Traditional NSGA-II algorithm	Workstation 1	1	3	2	1	1	2	1	2	184,500
	Workstation 2	1	0	3	2	1	1	1	3
	Workstation 3	0	2	1	0	1	2	0	0
Improved NSGA-II algorithm	Workstation 1	2	3	2	1	1	2	1	1	183,000
	Workstation 2	0	1	3	1	1	1	1	3
	Workstation 3	0	1	1	1	1	2	0	0

reports the equipment procurement plans and cost statistics for the corresponding solutions. These findings further demonstrate that the improved algorithm provides clear advantages.

Hyper-volume is a key metric for evaluating the performance of multi-objective optimization algorithms. A larger hyper-volume indicates a wider coverage of the target space by the Pareto-optimal solution set and a higher solution quality. Based on the calculation method proposed by Wang et al. [55],

Table 6. Comparison of Running Time and Hyper-volume between Traditional NSGAII and Improved NSGAII Algorithm.

	Run Time	Normalized Hyper-Volume (Mean)
Traditional NSGA-II	3:11:02	2.7599
Improved NSGA-II	4:45:47	4.8474

indicates that the improved NSGA-II algorithm achieves a significantly larger hyper-volume than the traditional NSGA-II algorithm, further confirming the superiority of the improved algorithm in terms of solution coverage and quality from a quantitative perspective.

Furthermore, the improved algorithm produces a more balanced performance of solutions on the Pareto front across multiple objectives. The Pareto front obtained by the traditional NSGA-II algorithm may include solutions that perform well on one objective but poorly on others; the improved algorithm better balances the relationships among objectives, yielding solutions with higher overall performance.

Regarding running time, the traditional NSGA-II algorithm exhibits faster performance (Table 6). This is because the improved NSGA-II algorithm incorporates additional operational steps and more complex computational logic, such as refined selection strategies and more sophisticated mutation methods, which increase the computational load and result in longer running times. However, given today’s advanced computing capabilities, from an application perspective, the running time for a single instance is no longer a major limitation for ALB.

Additionally, to assess the stability of the proposed model, ten independent experimental runs were conducted, and the standard deviation (SD) of the obtained results was calculated. The results demonstrated that the SD of the improved NSGA-II algorithm was 0.151, compared with 0.686 for the traditional NSGA-II algorithm. Furthermore, a two-sample t-test was performed to determine whether the difference in SDs between the two algorithms was statistically significant. The test results indicated a statistically significant difference (p < 0.01), confirming that the improved algorithm achieved more stable performance. Moreover, the 95% confidence interval (CI) for the mean difference was [1.54, 2.63], further supporting that the proposed improvements effectively maintained consistent optimization performance across different execution conditions.

To investigate the influence of the initial (minimum) value of parameter $\lambda$ in the affinity calculation on the performance of the improved NSGA-II algorithm, this study conducted a further analysis based on the case study, with the results presented in Figure 12.

It can be observed that, in terms of hyper-volume, the quality of the final solution varies with the initial value of parameter $\lambda$. In most cases, the improved NSGA-II algorithm outperforms the traditional NSGA-II algorithm, particularly when the initial value is approximately 0.6. The hyper-volume of the Pareto front solutions obtained by the improved NSGA-II algorithm is significantly larger than that of the traditional NSGA-II algorithm. This trend is especially evident in assembly line balancing problems with a large number of restrictive parallel constraints. By optimizing selection and mutation strategies, the improved NSGA-II algorithm is able to generate a more balanced workload distribution among workstations, achieve a more rational allocation of workstation numbers, and reduce equipment procurement costs, all while satisfying the design takt time requirements. Consequently, the algorithm enhances both the coverage of the Pareto front and the hypervolume indicator.

6. Conclusions

This study investigates assembly line balancing (ALB) problems with a large number of restrictive parallel constraints. Tasks are assigned to appropriate positions within suitable workstations. The assignment process considers both positional conflicts and device usage conflicts. Task start times are calculated according to the principle of parallelism, aiming to begin as early as possible. While satisfying the design takt time requirements, the approach aims to achieve three objectives: minimizing the number of workstations, balancing the workload among workstations, and minimizing device acquisition costs.

The ALB problem with restrictive parallel constraints is classified as NP-hard. The NSGA-II algorithm is a widely used method for solving NP-hard multi-objective optimization problems, and its effectiveness has been well established. However, due to the characteristics of the model proposed in this study, the traditional NSGA-II algorithm experienced premature convergence. Drawing on concepts from artificial immune algorithms and neighborhood search algorithms, this study improves the traditional NSGA-II algorithm from two perspectives: initial population generation and genetic operator design.

Case studies indicate that (1) the improved NSGA-II algorithm outperforms the traditional NSGA-II algorithm in overall solution quality; however, the redesign of genetic operators increases computational complexity, resulting in longer computation times compared to the traditional algorithm. (2) The initial value of parameter $\lambda$ in the affinity calculation significantly affects performance, with solution quality being higher when the initial value is approximately 0.6.

The proposed model effectively addresses the balancing problem of large-scale product assembly lines with numerous restrictive parallel constraints. Given the limited literature on the type of assembly line balancing problem addressed in this study and the scarcity of corresponding case sets, further comparative studies of algorithms are needed.

This study addresses the line balancing problem in large-scale product assembly lines. For the first time, practical constraints—including intra-station position conflicts and equipment conflicts—are comprehensively incorporated into the traditional assembly line balancing model. A multi-objective optimization model is developed with the objectives of minimizing the number of workstations, achieving a balanced task load across stations, and reducing equipment procurement costs, thereby simultaneously addressing production efficiency, cost control, and team management considerations. Regarding algorithm design, for large-scale parallel-task assembly line balancing problems, the NSGA-II algorithm is enhanced by integrating affinity and concentration selection strategies inspired by artificial immune algorithms, while neighborhood search is applied to optimize crossover and mutation operators, improving both solution efficiency and convergence performance. This study not only enhances the practical applicability of the model but also provides theoretical and methodological guidance for the optimized design of high-precision, large-scale product assembly lines, demonstrating substantial practical significance and innovation.

This study has certain limitations. Due to the limited availability of public benchmark cases for assembly line balancing problems with numerous restrictive parallel constraints, the number of case studies used for algorithm validation is relatively small, and therefore, the generalizability and practical applicability of the proposed method require further validation. Moreover, the algorithm’s performance is highly sensitive to the initial parameter settings, and it currently lacks a systematic self-adaptive adjustment mechanism. Additionally, several practical production factors—such as variations in worker proficiency, equipment maintenance schedules, and logistics constraints—were simplified during model formulation, potentially leading to deviations from real-world production scenarios. Future research should focus on expanding the benchmark case set, optimizing parameter configurations, reducing algorithmic complexity, and integrating more realistic production constraints to further enhance the robustness and applicability of the proposed model and algorithm.