Genetic search and the U-line balancing problem

In this research, we consider an application of genetic search to the U-line balancing problem. Although the literature has proposed genetic search to solve the balancing problem in both straight- and U-lines, it only examines the use of very few crossover and mutation operators. We attempt to conduct a comprehensive study of the effectiveness and efficiency of many crossover and mutation operators for the problem in this work. An extensive computational experiment is used to assess these operators. This assessment provides valuable insights into the design of the U-shaped production lines.