TY - JOUR
T1 - Optimal tolerance re-allocation for the generative process sequence
AU - Roy, Utpal
AU - Fang, Ying Che
PY - 1997/1
Y1 - 1997/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0030813259&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0030813259&partnerID=8YFLogxK
U2 - 10.1080/07408179708966310
DO - 10.1080/07408179708966310
M3 - Article
AN - SCOPUS:0030813259
SN - 0740-817X
VL - 29
SP - 37
EP - 44
JO - IIE Transactions (Institute of Industrial Engineers)
JF - IIE Transactions (Institute of Industrial Engineers)
IS - 1
ER -