Abstract
This paper studies the optimization of hole-making operations with multiple tools in which a hole may require various tools to its final size. The objective of this problem is to minimize the summation of tool airtime and tool switch time for the hole-making operations. As known, the problem is NP-hard. In this paper, we show a property that any infeasible permutation of hole-making operations can be transformed into a feasible one. Based upon this property, we apply a PSO based approach for solving a benchmark hole-making problem with the number of feasible operation sequences up to 5.41031. Numerical results indicate that the applied PSO approach can find superior solutions for the benchmark problem in the literature.
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.
