Heuristic approaches to solve the U-shaped line balancing problem augmented by genetic algorithms

Abstract

U-shaped production line can be described as a special type of cellular manufacturing used in just-in-time (JIT) and lean manufacturing. The U-line arranges machines around a U-shaped line in the order in which production operations are performed. Operators work inside the U-line. We address the Type 1 U-LBP using heuristic rules adapted from the simple LBP. Then these heuristic approaches are compared with the optimal solutions obtained from the previous published research work. Finally the heuristic rules are used as genes to find optimal or near optimal solutions using a genetic algorithm adapted from the simple LBP genetic algorithm proposed by Ponnam-balam, Aravindan, and Mogilesswar (2000). The results showed that some very simple heuristic rules produced optimal or near optimal solutions. Then with the simple implementation of a genetic algorithm it is possible to some times obtain optimal solutions in the first iteration