An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem
This paper evaluates a set of constructive heuristic methods developed to solve the novel Alternative Subgraphs Assembly Line Balancing Problem (ASALBP), which considers variants for different parts of a production or manufacturing process. Each variant is represented by a precedence subgraph that defines the tasks to be performed and their processing times. The proposed methods use priority rules and random choice to select the assembly subgraphs and to assign the tasks to the stations in order to minimize the number of required workstations. The methods are evaluated by a computational experiment based on medium- and large-scale benchmark problems.
assembly line balancing