跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2609.06318 · v3

A 5/3 Guarantee for Echelon Stock (R,nQ) Policies in Two-Stage Stochastic Serial Systems

两阶段随机串行系统中梯队库存(R,nQ)策略的5/3保证

首次提交 2026-09-06 08:40
版本更新 2026-11-19 02:28
雷达观测 2026-11-19 15:04
arXiv ↗PDF ↗

摘要

Fixed shipment costs encourage large orders, while inventory and customer backlog costs favor frequent replenishment. In a serial system, the stages must also coordinate their lot sizes and material availability. We study the classical echelon stock (R,nQ)(R,nQ) policy: the downstream stage requests a fixed lot, the upstream stage orders an integer multiple of that lot, and transfers contain complete lots. For unit Poisson demand, full backlogging, and at both stages, deterministic lead times, and setup and holding costs, we prove that the optimized cost in this class is at most 5/3≈1.6675/3\approx1.667 of the optimal admissible system cost, uniformly over all nonnegative cost rates, demand rates, and lead times. The guarantee holds even when the selected policy pays a setup charge for every lot while the optimal benchmark pays only once per aggregate shipment. To obtain the guarantee, we use a common inventory calculation that allows independently chosen replenishment frequencies while respecting upstream material availability. We compare its optimized value, an upper bound on the best integer-ratio policy cost, with a novel lower bound on the optimal system cost that combines allocated single-stage costs with the minimum inventory cost when setup costs are zero. We also show that no uniform factor below (1+3)/2≈1.366(1+\sqrt{3})/2\approx1.366 is possible for the classical class. Existing numerical experiments place best-found classical policies within 22.7%22.7\% of an evaluated lower bound across three broad grids. The results quantify both the reliability and the limits of a simple operating rule and explain how shipment consolidation, replenishment timing, and flexibility affect its value.

作者备注:33 pages of main text and references, plus a 32-page online appendix; 6 figures

AI 论文解读

基于摘要 · 非全文审阅

作者证明在两阶段随机串行系统中,优化的梯队库存(R,nQ)策略成本不超过最优允许系统成本的5/3,并给出下界1.366。

正在读取账号与研究记录…

版本差异

本站首次收录为 v3,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v3 · 2026-11-19 02:28 · 最新观测版本

A 5/3 Guarantee for Echelon Stock (R,nQ) Policies in Two-Stage Stochastic Serial Systems

Fixed shipment costs encourage large orders, while inventory and customer backlog costs favor frequent replenishment. In a serial system, the stages must also coordinate their lot sizes and material availability. We study the classical echelon stock (R,nQ)(R,nQ) policy: the downstream stage requests a fixed lot, the upstream stage orders an integer multiple of that lot, and transfers contain complete lots. For unit Poisson demand, full backlogging, and at both stages, deterministic lead times, and setup and holding costs, we prove that the optimized cost in this class is at most 5/3≈1.6675/3\approx1.667 of the optimal admissible system cost, uniformly over all nonnegative cost rates, demand rates, and lead times. The guarantee holds even when the selected policy pays a setup charge for every lot while the optimal benchmark pays only once per aggregate shipment. To obtain the guarantee, we use a common inventory calculation that allows independently chosen replenishment frequencies while respecting upstream material availability. We compare its optimized value, an upper bound on the best integer-ratio policy cost, with a novel lower bound on the optimal system cost that combines allocated single-stage costs with the minimum inventory cost when setup costs are zero. We also show that no uniform factor below (1+3)/2≈1.366(1+\sqrt{3})/2\approx1.366 is possible for the classical class. Existing numerical experiments place best-found classical policies within 22.7%22.7\% of an evaluated lower bound across three broad grids. The results quantify both the reliability and the limits of a simple operating rule and explain how shipment consolidation, replenishment timing, and flexibility affect its value.

查看此版本解读 →查看此版本原文 ↗