Article ID: | iaor20011273 |
Country: | South Korea |
Volume: | 25 |
Issue: | 1 |
Start Page Number: | 51 |
End Page Number: | 65 |
Publication Date: | Mar 2000 |
Journal: | Journal of the Korean ORMS Society |
Authors: | Kim Dong Mook |
Keywords: | genetic algorithms |
Multiple U-typed production lines are increasingly accepted in modern manufacturing system for the flexibility to adjust to changes in demand. This paper considers multiple U line balancing with the objective of minimizing cycle time considering the moving time of workforce given the number of workstation. Like the traditional line balancing problem this problem is NP-hard. In this paper, we show how genetic algorithm can be used to solve multiple U line balancing problem. For this, an encoding and a decoding method suitable to the problem are presented. Proper genetic operators are also employed. Extensive computational experiments are carried out to show the performance of the proposed algorithm. The computational results show that the algorithm is promising in solution quality.