A research of the stochastic U-type assembly line balancing problem

Author

Zhuo, Cheng ; Xu, Yingqiu ; Tan, Yingzi

Author_Institution

Sch. of Mech. Eng., Southeast Univ., Nanjing, China

Volume

Part 2

fYear

2011

fDate

3-5 Sept. 2011

Firstpage

874

Lastpage

878

Abstract

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.

Keywords

assembling; benchmark testing; genetic algorithms; just-in-time; lean production; stochastic processes; benchmark problem testing; car assembly; complex constraints; just in time; lean production; modified genetic algorithm; performance evaluation; stochastic U-type assembly line balancing problem; Assembly; Biological cells; Decoding; Encoding; Genetic algorithms; Stochastic processes; Workstations; Stochastic U-type assembly line balancing problem; complex constraints; genetic algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Industrial Engineering and Engineering Management (IE&EM), 2011 IEEE 18Th International Conference on

Conference_Location

Changchun

Print_ISBN

978-1-61284-446-6

Type

conf

DOI

10.1109/ICIEEM.2011.6035297

Filename

6035297