摘要
在多品种库存系统中采用联合补充订货方式可以创造大规模的经济效益。本文主要对具有复合泊松需求的联合补充问题进行研究。并针对此问题 ,提出一启发式算法 ,利用该算法可以寻找出在一定服务水平下 ,使单位时间内平均成本最小的补充策略。最后 ,通过算例对该算法进行验证。结果表明 。
In multi item inventory systems significant economies of scale can be exploited when the way of jointly replenishment orders for groups of items is adopted. This paper deals with joint replenishment problem with compound Poisson demand. A heuristic algorithm is developed to search control rule minimizing the long run average cost per unit time subject to a service level constraint. At last the algorithm is illustrated with an example. The results indicate that the heuristic algorithm can effectively solve the problem better.
出处
《系统工程》
CSCD
北大核心
2002年第3期9-14,共6页
Systems Engineering
基金
铁道部科技发展项目 (2 0 0 0 X0 4 8- B)
关键词
复合泊松需求
联合补充问题
库存理论
Joint Replenishment
Compound Poisson Demand Processes
Service Level Constraint
