.png){kind=icon}
返回
An efficient optimal solution method for the joint replenishment problem with minimum order quantities
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2005.02.056.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study the joint replenishment problem (JRP) for M items under deterministic demand, with a minimum order quantity constraint for each item in the replenishment order. We derive bounds on the basic cycle time and we propose an efficient global optimisation procedure to solve the JRP with constraints. Moreover, we also consider the case where a correction is made for empty replenishment occasions. The algorithms are tested with data from a real case and some additional numerical experiments are also presented. (c) 2005 Elsevier B.V. All rights reserved.
Keyword:
inventory
joint replenishment
minimum order quantities
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
.png){kind=icon}
