Optimization of sequential subdivision of depth of cut in turning operations using dynamic programming

The cutting sequence in the optimization of multipass turning operations has not gained much attention in many previous studies. The objective of this paper is to present a novel method to determine the optimal sequence of cutting passes and machining parameters in turning operations with practical constraints. The optimization problem of minimizing the total production cost is solved in two phases. The first phase is to achieve the minimum production cost for each cutting pass for the predefined depths of cut. A hybrid solver which combines a genetic algorithm and sequential quadratic programming technique is employed to accomplish this step. In the second phase, a dynamic programming technique is introduced to obtain the optimal sequential subdivision of the total depth of cut. Examples interpret the proposed procedure in detail. The results have proved this proposed methodology effective and of generality in comparison with the prior works.