Optimal tolerance re-allocation for the generative process sequence

Utpal Roy, Ying Che Fang

Research output: Contribution to journalArticle

13 Scopus citations

Abstract

In generative process planning, the sequence of machining processes is decided according to the specifications of parts, such as tolerance values. However, in order to obtain the minimal manufacturing cost, the machining process sequence needs to be considered before tolerances are assigned. It is therefore difficult to assign optimal tolerances so that a minimum manufacturing cost is achieved. This paper presents an iterative approach for reallocation of tolerance within the given functional constraints to minimize the manufacturing cost. With the given values of tolerance and corresponding process sequences, which are derived from a handbook or a designer's experience as initial inputs, each iteration of tolerance re-allocation tries to improve the total cost by shifting tolerances along the different processes in the current sequence. The re-allocation problem is formulated as a mixed integer nonlinear programming problem. The Lagrange Multiplier method has been used to solve nonlinear programming, and an exhaustive search method has been adopted to guarantee the global optimum in solving the zero-one algorithm. A prototype system has been implemented in an object-oriented programming environment and a case study is presented to demonstrate the capability of the system.

Original languageEnglish (US)
Pages (from-to)37-44
Number of pages8
JournalIIE Transactions (Institute of Industrial Engineers)
Volume29
Issue number1
DOIs
StatePublished - Jan 1997

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Optimal tolerance re-allocation for the generative process sequence'. Together they form a unique fingerprint.

  • Cite this