Please use this identifier to cite or link to this item: https://doi.org/10.1080/00207540412331281926
Title: Optimal cutter selection for complex three-axis NC mould machining
Authors: Ding, X.M.
Lu, Y.Q.
Fuh, J.Y.H. 
Lee, K.S. 
Issue Date: 15-Nov-2004
Source: Ding, X.M., Lu, Y.Q., Fuh, J.Y.H., Lee, K.S. (2004-11-15). Optimal cutter selection for complex three-axis NC mould machining. International Journal of Production Research 42 (22) : 4785-4801. ScholarBank@NUS Repository. https://doi.org/10.1080/00207540412331281926
Abstract: Proper cutter selection can reduce NC machining time greatly. Most researchers select cutters based on tool path generation, which is very time consuming, and only a very limited number of cutters can be selected. A new cutter selection methodology for complex mould machining based on an efficient interference detection algorithm is introduced. With this approach, the feasible regions for the candidate cutters are first identified without tool path generation. The machining times for different cutter combinations are then estimated based on the areas of the feasible regions and the cutter feed rates. The set of cutters that can machine the workpiece with minimum time is selected as the optimal candidate cutters. Since no tool path needs to be generated before cutter selection, the cutters can be selected efficiently, and the number of the cutters that can be used in NC machining can be quite large. The system has been tested with several industrial parts and it can select optimal cutters effectively and efficiently.
Source Title: International Journal of Production Research
URI: http://scholarbank.nus.edu.sg/handle/10635/61012
ISSN: 00207543
DOI: 10.1080/00207540412331281926
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

3
checked on Dec 14, 2017

WEB OF SCIENCETM
Citations

4
checked on Nov 16, 2017

Page view(s)

18
checked on Dec 17, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.