Dynamic programming algorithm for generating two-staged homogenous strip cutting patterns

The cutting cost of general two-staged patterns is relatively high when the unit cutting cost is expensive. A dynamic programming algorithm for generating two-staged homogenous strip cutting patterns is presented in this paper. It can obviously reduce the number of cuts to maximize the pattern value. The algorithm determines the strip layout on the plate optimally at the first stage. The strips of the same homogenous block are cut jointly into pieces at the second stage. The experimental computational indicates that the algorithm is effective.