DocumentCode :
2697058
Title :
Novel cellular automata algorithm for assembly line balancing problem of type-2
Author :
Tang, Qiuhua ; Lu, Suli ; Li, Ming ; Floudas, C.A.
Author_Institution :
Ind. Eng. Dept., Wuhan Univ. of Sci. & Technol., Wuhan, China
fYear :
2011
fDate :
26-28 Oct. 2011
Firstpage :
422
Lastpage :
428
Abstract :
Simple assembly line balancing problem with the objective of minimizing production cycle time called SALBP-2 usually is widely applied in automotive and electronic manufacturing production lines. In this paper a novel algorithm for solving SALBP-2 is proposed based on cellular automata (CA), which has the potentiality of solving time, space or parameter discrete optimization problems. Three types of CA model are presented to implement the evolution rules, shift and swap. All of them are coded in MATLAB, and their efficiencies are tested on benchmarks. Also a comparison study is made with other publications. Test and comparison results show that the novel cellular automata algorithm can get good results for SALBP-2.
Keywords :
assembling; automotive engineering; cellular automata; electronics industry; optimisation; production management; MATLAB; SALBP-2; automotive manufacturing production lines; cellular automata algorithm; discrete optimization problems; electronic manufacturing production lines; evolution rules; production cycle time minimization; type-2 assembly line balancing problem; Dispatching; Neodymium; Space stations; Workstations; Cellular Automata; Evolution Rule; Simple Assembly Line Balancing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Pervasive Computing and Applications (ICPCA), 2011 6th International Conference on
Conference_Location :
Port Elizabeth
Print_ISBN :
978-1-4577-0209-9
Type :
conf
DOI :
10.1109/ICPCA.2011.6106542
Filename :
6106542
Link To Document :
بازگشت