Infinitesimal dividing method: Sole supplier inventory cost model with random lead times

被引：0
|
作者：
Ji, Peng-Cheng [1 ]
Song, Shi-Ji [1 ]
Wu, Cheng [1 ]
机构：
[1] Tsinghua Univ, Dept Automat, Beijing 100084, Peoples R China
来源：
PROCEEDINGS OF 2006 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7 | 2006年
基金：
美国国家科学基金会;
关键词：
inventory management; random lead time; infinitesimal dividing method; convex optimization;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper considers the inventory model with random procurement lead time. Using infinitesimal dividing method, the exact (Q,r) inventory cost model of single supplier procurement is presented, which is proved equal to the traditional model. Main properties of the model are analyzed strictly. The convexity of the cost function per unit time is proved. Then the optimal solution can be easily obtained by applying the classical convex optimization methods. Finally, numerical examples are given to verify the main conclusions in this paper.
引用
收藏
页码：225 / +
页数：2
相关论文
共 50 条
12345