Answers are grounded in this paper and cite their sources.
Finds a new method improves assembly line efficiency, suggesting better production designs.
Assembly lines are widely used for mass production. Their design and operation of such systems involve the resolution of multiple problems, among which the assembly line balancing problem (ALBP) is one of the most studied. An ALBP typically involves at least two interrelated decisions aimed at optimising line efficiency: (1) determining the sequence in which operations must be performed within the assembly line and (2) assigning these tasks to the stations that constitute the assembly line. This study presents a general methodology for solving a broad range of ALBPs based on the observation that many such problems can be decomposed into interrelated subproblems. The proposed method leverages the fact that once a task sequence is fixed, optimal station assignments can be obtained through a dynamic programming (DP) recursion. To illustrate the proposed methodology, we derive DP formulations for multiple ALBP variants and integrate them into heuristic frameworks that explore a solution space represented by task sequences. Computational experiments using a genetic algorithm and a local search procedure demonstrate the adaptability and effectiveness of the proposed approach. In particular, for sequence-dependent and chance-constrained assembly line balancing problems, the method achieves higher-quality solutions in shorter computational times than current state-of-the-art techniques.
No takes yet. Share an insight, caveat, or question.
Pereira et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: