.png){kind=icon}
返回
Bun splitting: a practical cutting stock problem
.png){kind=icon}
OA
AI
DOI：10.1007/s10479-008-0458-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We describe a new hierarchical 2D-guillotine Cutting Stock Problem. In contrast to the classic cutting stock problem, waste is not an issue. The problem relates to the removal of a defective part and assembly of the remaining parts into homogeneous size blocks. The context is the packing stages of cake manufacturing. The company's primary objective is to minimise total processing time at the subsequent, packing stage. This objective reduces to one of minimising the number of parts produced when cutting the tray load of buns. We offer a closed form optimization approach to this class of problems for certain cases, without recourse to mathematical programming or heuristics. The methodology is demonstrated through a case study in which the number of parts is reduced by almost a fifth, and the manufacturer's subsidiary requirement to reduce isolated single bun parts and hence customer complaints is also satisfied.
Keyword:
Two-dimensional cutting stock problem
Multi-stage optimization
Bakery
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容