...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of production economics >Myopic optimal policy for a multi-period, two-delivery-lead-times, stochastic inventory problem with minimum cumulative commitment and capacity
【24h】

Myopic optimal policy for a multi-period, two-delivery-lead-times, stochastic inventory problem with minimum cumulative commitment and capacity

机译：具有最小累积承诺和容量的多周期，两个交货提前期的随机库存问题的近视最优策略

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper studies a single-product, multi-period, stochastic inventory problem that imposes the lower and upper bounds on the cumulative order quantity during a planning horizon and allows two delivery lead times. This model includes three features. The first one is that a buyer purchases a fixed capacity from a supplier at the beginning of a planning horizon and the buyer's total cumulative order quantity during the planning horizon is constrained with the capacity. The second one is that the buyer agrees to purchase the product at least a certain percentage of the purchased capacity during the planning horizon. The third one is that the supplier allows the buyer to order the product with two-delivery-lead-times. We identify conditions under which a myopic ordering policy is optimal. We also develop an algorithm to calculate the optimal capacity when the minimum cumulative order quantity commitment is a certain percentage of the capacity. We then use the algorithm to evaluate the effect of the various parameters on the buyer's minimum expected total cost during the planning horizon. Our computation shows that the buyer would benefit from the commitments and two-delivery-lead-times.
机译：本文研究了一种单产品，多周期，随机库存问题，该问题在计划范围内将累计订单数量上下限，并允许两个交货提前期。该模型包括三个功能。第一个是买方在计划范围的开始时从供应商处购买固定容量，并且买方在计划范围内的总累计订单数量受容量的限制。第二个是购买者同意在计划范围内至少购买一定比例的产品。第三个是供应商允许买方以两个交货提前期订购产品。我们确定在什么条件下近视订购策略是最佳的。我们还开发了一种算法，当最小累计订单量承诺为容量的某个百分比时，计算最佳容量。然后，我们使用该算法来评估各种参数对计划范围内买方的最低预期总成本的影响。我们的计算表明，买方将受益于承诺和两次交货的交货时间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号