Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
复制标题
无能力动态批量问题的近似方法
DOI：
10.1287/mnsc.30.9.1121
复制
发表时间：
1984
影响因子：
5.4
通讯作者：
H. Yanasse
中科院分区：
文献类型：
--
作者：
G. Bitran;T. Magnanti;H. Yanasse
我们为无容量动态批量问题的几种近似方法启发法、产品聚合和规划范围划分提供了最坏情况的误差范围。我们提出了两种面向管理的启发法，并表明它们的相对惯常误差界等于二，并对称为单位成本启发法、部分周期平衡启发法和以需求时间供应表示的经济订单数量启发法的方法进行了类似的分析。我们还展示了多产品多设施问题中规划范围划分引入的误差如何受到产品设置成本的限制，以及产品聚合引入的错误如何受到设置成本、持有成本和需求的限制。后面的结果提出了最小化最坏情况误差范围的产品聚合方法。
We provide worst case error bounds for several approximation methods heuristics, product aggregation, and partitioning of the planning horizon for the uncapacitated dynamic lot size problem. We propose two managerially oriented heuristics and show that they have a relative wont case error bound equal to two, and develop similar analyses for methods known as the least cost per unit heuristic, the part period balancing heuristic, and an economic order quantity heuristic expressed in terms of a time supply of demand. We also show how errors introduced by partitioning of the planning horizon in multi-product multi-facility problems are bounded by product set-up costs, and how errors introduced by product aggregation are bounded by set-up costs, holding costs, and demands. The latter results suggest methods for product aggregation that minimize the worst case error bounds.