Show simple item record

contributor authorCheol W. Lee
date accessioned2017-05-09T00:34:09Z
date available2017-05-09T00:34:09Z
date copyrightApril, 2009
date issued2009
identifier issn1087-1357
identifier otherJMSEFK-28113#021006_1.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/141253
description abstractThis paper presents a novel dynamic optimization framework for the grinding process in batch production. The grinding process exhibits time-varying characteristics due to the progressive wear of the grinding wheel. Nevertheless, many existing frameworks for the grinding process can optimize only 1 cycle at a time, thereby generating suboptimal solutions. Moreover, dynamic scheduling of dressing operations in response to process feedback would require significant human intervention with existing methods. We propose a unique dynamic programming–evolution strategy framework to optimize a series of grinding cycles depending on the wheel condition and batch size. In the proposed framework, a dynamic programming module dynamically determines the frequency and parameter of wheel dressing while the evolution strategy locates the optimal operating parameters of each cycle subject to the constraints on the operating ranges and part quality. Case studies based on experimental data are conducted to demonstrate the advantages of the proposed method over conventional approaches.
publisherThe American Society of Mechanical Engineers (ASME)
titleDynamic Optimization of the Grinding Process in Batch Production
typeJournal Paper
journal volume131
journal issue2
journal titleJournal of Manufacturing Science and Engineering
identifier doi10.1115/1.3090880
journal fristpage21006
identifier eissn1528-8935
keywordsOptimization
keywordsCycles
keywordsDynamic programming
keywordsWheels
keywordsGrinding AND Algorithms
treeJournal of Manufacturing Science and Engineering:;2009:;volume( 131 ):;issue: 002
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record