.png){kind=icon}
返回
Joint replenishment problem under continuous unit cost change
.png){kind=icon}
PRE
AI
DOI：10.1080/0020754042000270368.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The joint replenishment problem determines order quantities and the grouping of products replenished from the same supplier. The objective is to minimize the ordering and holding cost of the purchasing firm. The problem is frequently solved assuming products with constant unit cost. An efficient algorithm for solving the joint replenishment problem for products that may be experiencing unit cost increase or decrease is developed. The proposed algorithm is tested on a sample of randomly generated problems containing up to 25 items and it is shown that it identifies the global optimal solutions for most of these problems. For the worst case where the algorithm fails to identify the global optimal solution, the solution it provides had a total cost 0.007% above the global minimum.
Keyword:
joint replenishment
continuous unit cost decrease or increase
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
暂无机构信息
引用论文
Calcium/calmodulin-dependent protein kinases in the carotid body: an immunohistochemical study.png)
SpringerPlus
OAAI
SpringerPlusIF0
OAAI分享收藏Abi1 mediates airway smooth muscle cell proliferation and airway remodeling via Jak2/STAT3 signalingiScience
OAAI
iScienceIF0
OAAI分享收藏
查看更多内容