.png){kind=icon}
返回
Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2014.12.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The primary objective in the one-dimensional cutting stock problem is to minimize material cost. In real applications it is often necessary to consider auxiliary objectives, one of which is to reduce the number of different cutting patterns (setups). This paper first presents an integer linear programming model to minimize the sum of material and setup costs over a given pattern set, and then describes a sequential grouping procedure to generate the patterns in the set. Two sets of benchmark instances are used in the computational test. The results indicate that the approach is efficient in improving the solution quality. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Cutting
Cutting stock
One-dimensional cutting
Pattern reduction
Setup cost
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Sequential grouping heuristic for the two-dimensional cutting stock problem with pattern reduction
PREAI
分享收藏A hybrid heuristic to reduce the number of different patterns in cutting stock problems一种混合启发式方法，用于减少切割库存问题中不同模式的数量
PREAI
分享收藏
查看更多内容