A Research of the Stochastic U-type Assembly Line Balancing Problem
U-type assembly lines, as an important part of Lean Production and Just-in-time, have been applied widely in practice. The stochastic U-type assembly line balancing problem is studied in this paper. The genetic algorithm is designed to solve this problem. Benchmark problems are tested to evaluate the performance of the presented algorithm. Furthermore, considering six kinds of complex constraints between task units, the stochastic U-type assembly line balancing problem with complex constraints is proposed and solved by modified genetic algorithm. A case from car assembly is shown to explain its application.
Cheng ZHUO Yingqiu XU Yingzi TAN
School of Mechanical Engineering, Southeast University, Nanjing 210096, China School of Mechanical Engineering, Southeast University, Nanjing 210096, China RoboCup Research Group RoboCup Research Group, Southeast University, Nanjing 210096, China
国际会议
长春
英文
874-878
2011-09-03(万方平台首次上网日期,不代表论文的发表时间)