@conference {18802,
	title = {A geometric algorithm for selecting optimal set of cutters for multi-part milling},
	series = {SMA {\textquoteright}01},
	year = {2001},
	month = {2001///},
	pages = {130 - 139},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {For the manufacture of milled parts, it is well known that the size of the cutter significantly affects the machining time. However, for small-batch manufacturing, the time spent on loading tools into the tool magazine and establishing z-length compensation values is just as important. If we can select a set of milling tools that will produce good machining time on more than one type of parts, then several unnecessary machine-tool reconfiguration operations can be eliminated. This paper describes a geometric algorithm for finding an optimal set of cutters for machining a set of 2{\textonehalf}D parts. In selecting milling cutters we consider both the tool loading time and the machining time and generate solutions that allow us to minimize the total machining time. Our problem formulation addresses the general problem of how to cover a target region to be milled with a cylindrical cutter without intersecting with the obstruction region; this definition allows us to handle both open and closed edges in the target region. Our algorithm improves upon previous work in the tool selection area in following ways: (1) in selecting cutters, it accounts for the tool loading time, and (2) it can simultaneously consider multiple different parts and select the optimal set of cutters to minimize the total manufacturing time.},
	keywords = {computer-aided process planning, milling cutter selection},
	isbn = {1-58113-366-9},
	doi = {10.1145/376957.376973},
	url = {http://doi.acm.org/10.1145/376957.376973},
	author = {Yao,Zhiyang and Gupta, Satyandra K. and Nau, Dana S.}
}
