.png){kind=icon}
返回
The linear dynamic lot size problem with minimum order quantity
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2011.05.017.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper continues the analysis of a special uncapacitated single item lot sizing problem where a minimum order quantity restriction, instead of the setup cost, guarantees a certain level of production lots. A detailed analysis of the model and an investigation of the particularities of the cumulative demand structure allow us to develop a solution algorithm based on the concept of atomic sub-problems. We present an optimal solution to an atomic sub-problem in an explicit form and prove that it serves as a construction block for the optimal solution of the original problem. Computational tests and a comparison with a published algorithm confirm the efficiency of the solution algorithm developed here. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Lot sizing problem
Minimum order quantity
Dynamic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.1K
被引数:
3.6W
机构
引用论文
.png){kind=icon}
Lead time minimization of a multi-product, single-processor system: A comparison of cyclic policies
PREAI
分享收藏
查看更多内容