.png){kind=icon}
返回
An efficient model for the crosscut optimisation problem in a wood processing mill
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2010.538446.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a dynamic programming model for the crosscut optimisation problem. This problem arises in the context of cutting lumber (rip-first) in order to obtain cubic blocks (cut-pieces) with required dimensions and surface characteristics. We propose a novel approach for matching the pattern of defects on all four surfaces of an incoming strip of wood with the surface requirements of the cut-pieces as specified in a given cut-bill, and determine an effective cutting pattern for each incoming strip accordingly. Our proposed dynamic programming model results in fast execution times as shown by the results of a computational experiment. The model is deployed in a software package that has been implemented successfully in several major rough mills.
Keyword:
dynamic programming
cutting stock problem
cutting lumber
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容