Abstract
Allocating tolerance to sub-components of a complex assembly with alternative processes selection by using Lagrange’s multiplier method is tedious as well as difficult. The present work is aims to solve the problem with simple effort in three stages. In the first stage, the maximum of two processes are selected from the alternative processes of each component and these two processes correspond to the smaller sum of difference in manufacturing cost. A hybrid optimum tolerance allocation method is developed in a second and third stage by combining Tabu search (TS) and heuristic approach. Application of the proposed algorithm is demonstrated on complex tolerancing products like knuckle joint and wheel mounting assembly. For the same manufacturing conditions, compared with tolerance synthesis by Singh method, the proposed method saved nearly $74,880 and $479,520, respectively, per year in manufacturing costs of knuckle joint and wheel mounting assembly.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ostwald PF, Huang J (1977) A method for optimal tolerance selection. T ASME J Eng Ind 99:558–565
Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Schemes 8(1):156–166
Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13(5):533–549
Lee WJ, Woo TC (1989) Optimum selection of discrete tolerances. T ASME J Mech Transmissions Autom Des 111:243–251
Chase KW, Greenwood WH, Loosli BG, Hauglund LF (1990) Least cost tolerance allocation for mechanical assemblies with automated process selection. Manuf Rev 3(1):49–59
Zhang C, Wang HP (1993) The discrete tolerance optimization problem. Manuf Rev 6(1):60–71
Hao J-K, Dorne R, Galinier P (1998) Tabu search for frequency assignment in mobile radio networks. J Heuristics 4(1):47–62
Wu CC, Tang GK (1998) Tolerance designs for products with asymmetric quality losses. Int J Prod Res 36(9):2529–2541
Chase KW (1999) Minimum cost tolerance allocation. ADCATS Report No. 99-5, Brigham Young University, Provo, Utah
Diplaris SC, Sfantsikopoulos MM (2001) Cost – tolerance function: a new approach for cost optimum machining accuracy. Int J Adv Manuf Technol 16(1):32–38
Carfagni M, Governi L, Fhiesi F (2001) Development of a method for automatic tolerance allocation. Proc. of the XII ADM International Conference, Italy, pp. D1-20–D1-27
Ye B, Salustri FA (2003) Simultaneous tolerance synthesis for manufacturing and quality. Research in Engineering Design, University of Windor
Singh PK, Jain SC, Jain PK (2004) A GA-based solution to optimum tolerance synthesis of mechanical assemblies with alternate manufacturing processes: focus on complex tolerancing problems. Int J Prod Res 42(24):5185–5215
Armentano VA, Claudio JE (2004) An application of a multi-objective Tabu search algorithm to a bicriteria flowshop problem. J Heuristics 10(5):463–481
Nowicki E, Smuntnicki C (2005) An advanced Tabu search algorithm for the job shop problem. J Sched 8(2):145–159
Zhang CY, Li PG, Guan ZL, Rao YQ (2007) A Tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput Operat Res 34(11):3229–3242
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kumar, M.S., Kannan, S.M. & Jayabalan, V. A new algorithm for optimum tolerance allocation of complex assemblies with alternative processes selection. Int J Adv Manuf Technol 40, 819–836 (2009). https://doi.org/10.1007/s00170-008-1389-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-008-1389-5