Optimal and near-optimal policies for lost sales inventory models with at most one replenishment order outstanding
详细信息查看全文 | 推荐本文 |
摘要
In this paper we use policy-iteration to explore the behaviour of optimal control policies for lost sales inventory models with the constraint that not more than one replenishment order may be outstanding at any time. Continuous and periodic review, fixed and variable lead times, replenishment order sizes which are constrained to be an integral multiple of some fixed unit of transfer and service level constraint models are all considered. Demand is discrete and, for continuous review, assumed to derive from a compound Poisson process. It is demonstrated that, in general, neither the best (s, S) nor the best (r, Q) policy is optimal but that the best policy from within those classes will have a cost which is generally close to that of the optimal policy obtained by policy iteration. Finally, near-optimal computationally-efficient control procedures for finding (s, S) and (r, Q) policies are proposed and their performance illustrated.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700