Abstract
AbstractHole-making is a type of machining processes that are specifically used to cut a hole into a part. The objective of interest in hole-making operations is to reduce the summation of tool airtime and tool switching time in order to reduce total processing time. This objective is affected by the sequence through which operations are done. This problem is formulated as a zero–one nonlinear mathematical programming model. In this paper, a dynamic programming-based method is developed to solve the proposed mathematical model and obtain the globally optimum solutions. An illustrative example is given to show the application and efficiency of the proposed method for optimizing the sequence of hole-making operations in a typical industrial part. The quality of solutions obtained by the proposed method is compared to those obtained by both branch-and-bound method and an ant algorithm available in the literature. The computational experiments reflect the high efficiency of our proposed method.
Highlights
Hole-making operations such as drilling, reaming, and tapping compose a large portion of machining processes for most industrial parts
A dynamic programming-based method is proposed to determine the optimum sequence resulting in minimum value for summation of tool airtime and tool switching time in hole-making operations
In this paper a dynamic programming-based method is proposed to determine the optimum sequence resulting in minimum value for summation of tool airtime and tool switching time in holemaking operations
Summary
Hole-making operations such as drilling, reaming, and tapping compose a large portion of machining processes for most industrial parts. A dynamic programming-based method is proposed to determine the optimum sequence resulting in minimum value for summation of tool airtime and tool switching time in hole-making operations. Kolahan and Liang (2000) used a Tabu search (TS) approach to minimize the total processing cost for hole-making operations They considered four issues as decision variables. Ghaiebi and Solimanpur (2007) considered optimization of hole-making operations when a hole may need several tools to get completed and used an ant algorithm to solve the problem. They have formulated the hole-making problem as a zero–one nonlinear mathematical model.
Sign-in/Register to view highlights & summary 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 callDisclaimer: 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.
