.png){kind=icon}
返回
Two-dimensional cutting stock problem with sequence dependent setup times
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2017.07.036.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Motivated by a firm in the technical textile industry, we study a two-dimensional cutting stock problem with sequence dependent setup times and permissible tolerances. We provide a sequential heuristic with feedback loop based on the approach of Gilmore and Gomory and formulate the sequencing problem as a mixed integer program. We derive a lower bound algorithm and demonstrate the near-optimal performance of our heuristic. Finally, we use real data to test our heuristic and illustrate its applicability to a problem of realistic size. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Cutting stock problem
Sequence dependent setup times
Heuristics
Application
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Bin packing and cutting stock problems: Mathematical models and exact algorithms装箱和切割库存问题: 数学模型和精确算法
.png){kind=icon}
PREAI
分享收藏分享收藏分享收藏
查看更多内容