Abstract
This paper describes an algorithm to select the cheapest tool sequence for machining 2.5D pockets using the milling process when the stock is uneven (noncylindrical). Uneven stock is generated when multiple setups are used to machine a prismatic part. Even though the pockets have flat bottom faces, the amount of material to be removed will vary along the depth of the pocket. This research has developed algorithms for finding accessible areas for tools, and pocket decomposition when the stock is uneven. Finally, it is shown that tool sequence selection problem can be formulated as the shortest path problem in a single-source, single-sink directed acyclic graph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Computing and Information Science in Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
