经济仓库批量调度:通过高效可表示的动态规划编码策略实现近似方案
Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies
AI总结:
本文提出了一种针对经济仓库批量调度问题的多项式时间近似方案,通过高效可表示的动态规划编码策略实现近优补货策略的设计。
摘要:
在本文中,我们提出了针对真正库存管理经典问题——经济仓库批量调度问题的高效构造近优补货策略的算法进展。虽然自20世纪50年代末以来,这一范式已积累了大量的相关文献,但就基本的计算问题而言,我们仍然处于黑暗中,这可能是因为在此背景下动态策略的内在复杂性。后者特征迫使早期尝试要么研究高度结构化的策略类别,要么放弃能够保证良好性能保证的方案;至今,能够严格分析的结果寥寥无几。本文发展了直接与动态策略竞争的新型分析基础。结合进一步的算法进展和新获得的见解,这些想法最终导致了对恒定数量商品的多项式时间近似方案。在这方面,高效设计ε-最优动态策略似乎处于无法实现的境地,因为除了其内在的算法挑战外,甚至这样的策略的多项式空间表示也一直是基本的开放问题。
英文摘要:
In this focused technical paper, we present long-awaited algorithmic advances toward the efficient construction of near-optimal replenishment policies for a true inventory management classic, the economic warehouse lot scheduling problem. While this paradigm has accumulated a massive body of surrounding literature since its inception in the late '50s, we are still very much in the dark as far as basic computational questions are concerned, perhaps due to the intrinsic complexity of dynamic policies in this context. The latter feature forced earlier attempts to either study highly-structured classes of policies or to forgo provably-good performance guarantees altogether; to this day, rigorously analyzable results have been few and far between. The current paper develops novel analytical foundations for directly competing against dynamic policies. Combined with further algorithmic progress and newly-gained insights, these ideas culminate in a polynomial-time approximation scheme for constantly-many commodities. In this regard, the efficient design of $ε$-optimal dynamic policies appeared to have been out of reach, since beyond their inherent algorithmic challenges, even the polynomial-space representation of such policies has been a fundamental open question.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。