DocumentCode :
2832251
Title :
Searching optimal resequencing and feature assignment on an automated assembly line
Author :
Lim, Andrew ; Xu, Zhou
Author_Institution :
Dept. of Ind. Eng. & Logistics Manage., Hong Kong Univ. of Sci. & Technol.
fYear :
2005
fDate :
16-16 Nov. 2005
Lastpage :
498
Abstract :
In this paper, we have solved the resequencing and feature assignment problem (RFAP) by an iterative search scheme, which can obtain optimum solutions for instances sized as large as that in reality. The search scheme is based on a beam search heuristic, which outperform other heuristics in previous literature. The algorithms proposed can therefore be utilized to improve the vehicle manufacturing and to benchmark the optimum or near-optimum solutions for future research
Keywords :
assembling; optimisation; search problems; vehicles; automated assembly line; beam search heuristic; iterative search scheme; optimum solution; resequencing-and-feature-assignment-problem; vehicle manufacturing; Assembly; Buffer storage; Costs; Engineering management; Industrial engineering; Logistics; Painting; Paints; Technology management; Vehicles;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Tools with Artificial Intelligence, 2005. ICTAI 05. 17th IEEE International Conference on
Conference_Location :
Hong Kong
ISSN :
1082-3409
Print_ISBN :
0-7695-2488-5
Type :
conf
DOI :
10.1109/ICTAI.2005.114
Filename :
1562984
Link To Document :
بازگشت