首页> 外文会议>Integer Programming and Combinatorial Optimization >A Polynomial Time Algorithm for the StochasticUncapacitated Lot-Sizing Problem with Backlogging
【24h】

A Polynomial Time Algorithm for the StochasticUncapacitated Lot-Sizing Problem with Backlogging

机译:带有积压的随机无容量批量问题的多项式时间算法

获取原文
获取原文并翻译 | 示例

摘要

Since Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, many other researchers have investigated the structure of other fundamental models on lot-sizing that are embedded in practical production planning problems. In this paper we consider basic versions of such models in which demand (and other problem parameters) are stochastic rather than deterministic. It is named stochastic uncapacitated lot-sizing problem with backlogging. We define a production path property of optimal solutions for this model and use this property to develop backward dynamic programming recursions. This approach allows us to show that the value function is piecewise linear and continuous, which we can further use to define a polynomial time algorithm for the problem in a general stochastic scenario tree setting.
机译:自Wagner和Whitin发表关于确定性的无能力批量问题的开创性论文以来,许多其他研究人员已研究了嵌入实际生产计划问题中的其他基本批量模型的结构。在本文中,我们考虑了这种模型的基本版本,其中需求(和其他问题参数)是随机的,而不是确定性的。它被称为带有积压的随机,无能力的批量问题。我们为此模型定义了最佳解决方案的生产路径属性,并使用该属性来开发后向动态编程递归。这种方法使我们能够证明值函数是分段线性且连续的,可以将其进一步用于为一般随机场景树设置中的问题定义多项式时间算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号