Application of dynamic programming to multi-stage batch machining

Abstract

This paper presents an algorithm based on dynamic programming for the optimization of a series of manufacturing operations during multi-stage batch machining. The machine variables can be treated as discrete when necessary. The lower and upper limits of the overall cycle time are computed first. The interval between these limits is then divided into a sufficiently large number of parts to define a number of feasible cycle times. We then compute the optimum values of the process variables for each operation and the value of the chosen objective function corresponding to each of the cycle times. The cycle time and process variables of each operation are optimum corresponding to which objective function is optimized. The algorithm has been applied to a test problem. The results have been found to be directly usable and realistic.