Show simple item record

contributor authorJ. R. Li
contributor authorS. B. Tor
contributor authorL. P. Khoo
contributor authorASME Mem.
date accessioned2017-05-09T00:07:00Z
date available2017-05-09T00:07:00Z
date copyrightMarch, 2002
date issued2002
identifier issn1530-9827
identifier otherJCISB6-25913#28_1.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/126475
description abstractThis paper describes a hybrid approach to handle disassembly sequence planning for maintenance. The product under maintenance is first modeled using a novel hybrid graph known as Disassembly Constraint Graph (DCG) which embodies complete disassembly information and can be used to prune the search space of disassembly sequences. Subsequently, a novel Tabu-enhanced GA engine is invoked to generate the near optimal disassembly sequences. A case study was used to illustrate the effectiveness of the proposed approach. The details of the DCG, the TS-enhanced GA engine and the fitness function used are presented in this paper.
publisherThe American Society of Mechanical Engineers (ASME)
titleA Hybrid Disassembly Sequence Planning Approach for Maintenance
typeJournal Paper
journal volume2
journal issue1
journal titleJournal of Computing and Information Science in Engineering
identifier doi10.1115/1.1481370
journal fristpage28
journal lastpage37
identifier eissn1530-9827
keywordsMaintenance
keywordsSurgery
keywordsProject tasks AND Optimization
treeJournal of Computing and Information Science in Engineering:;2002:;volume( 002 ):;issue: 001
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record