A study on the 3-stage 3-dimensional guillotine cutting-stock problem

3차원 기로틴 3단계 자재절단 방법에 관한 연구

This paper deals with the method providing an exact solution to the 3-dimensional guillotine cutting stock problem. We suggest a 3-stage sutting method using the property that cubic material has to be cut into 2-dimensional planes firstly. This method requires more stocks that the general guillotine cutting methods but can save work force. By using the 1-dimensional dynamic programming, we reduce the computational time and the memory requirement in the 3-stage guillotine cutting method.