Show simple item record

contributor authorH. Fujimoto
contributor authorM. F. Sebaaly
date accessioned2017-05-09T00:02:58Z
date available2017-05-09T00:02:58Z
date copyrightFebruary, 2000
date issued2000
identifier issn1087-1357
identifier otherJMSEFK-27355#198_1.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/124026
description abstractAssembly planning is the problem of finding the best or optimal sequence to assemble a product, starting from its design data. It is still solved manually in most advanced assembly plants, despite the large amount of related research. One of the main reasons might be the use of exact- and/or linear-solution approaches. This paper introduces a different approach by applying a modified genetic algorithm (GA). A “best” solution is generated without searching the complete candidate space, while search is performed on a sequence population basis. The GA is modified to cope with sequence nonlinearity and constraints. [S1087-1357(00)70401-1]
publisherThe American Society of Mechanical Engineers (ASME)
titleA New Sequence Evolution Approach to Assembly Planning
typeJournal Paper
journal volume122
journal issue1
journal titleJournal of Manufacturing Science and Engineering
identifier doi10.1115/1.538897
journal fristpage198
journal lastpage205
identifier eissn1528-8935
keywordsManufacturing
treeJournal of Manufacturing Science and Engineering:;2000:;volume( 122 ):;issue: 001
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record