.png){kind=icon}
返回
An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2011.04.029.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing problems with backlogging, whose linear programming relaxations provide good lower bounds on the optimal solution value. We show that both of these strong formulations yield the same lower bounds. In addition to these theoretical results, we propose a new, effective optimization framework that achieves high quality solutions in reasonable computational time. Computational results show that the proposed optimization framework is superior to other well-known approaches on several important performance dimensions. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Capacitated
Multi-level
Lot-sizing
Backlogging
Lower and upper bound guided nested partitions
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Mathematical models for capacitated multi-level production planning problems with linked lot sizes具有关联批量的产能多级生产计划问题的数学模型
PREAI
分享收藏Association between continuous deep sedation and survival time in terminally ill cancer patients
PREAI
分享收藏
查看更多内容