%0 Journal Article
%A ZHANG Yu
%A CUI Yaodong
%A LIANG Zehua
%T Two-dimensional cutting stock problem of multiple logs
%D 2018
%R 10.3778/j.issn.1002-8331.1706-0201
%J Computer Engineering and Applications
%P 266-270
%V 54
%N 19
%X The cutting stock problem of log can be seen in timber enterprise. If the diameter of head and tail is similar, the log is regarded as a cylinder. Assuming that the length of the log is equal to the length of the blank, then the three-dimensional problem can be converted to two-dimensional cutting stock problem. Sequential value correction and dynamic programming algorithm are proposed to solve the cutting stock problem of log. The pattern is generated in order. The value of the blank will be adjusted after each pattern is generated. Multiple cutting plans are generated through iteration and the best one will be selected. The proposed studies can help the enterprise to reduce the cost.
%U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.1706-0201