Non-stationary ordering policies for multi-item inventory systems subject to a single resource constraint and quantity discounts

被引：0

作者：

Guder, Faruk ^{[1
]}

Zydiak, James L. ^{[1
]}

机构：

[1] Loyola Univ, Chicago, United States

来源：

Computers and Operations Research | 1997年 / 24卷 / 01期

关键词：

Computational methods - Constraint theory - Heuristic methods - Inventory control - Optimization - Problem solving - Resource allocation;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

The multi-item inventory problem with a single resource constraint and quantity discounts is studied in this paper. Known solution approaches to this problem, both heuristic and enumerative, assume that ordering policies are stationary. A new heuristic approach is presented here for generating non-stationary ordering policies, with order quantities that can vary over time. Computational results for comparing these methods are given. The non-stationary approach is shown in these experiments to outperform heuristic stationary approaches, and an enumerative stationary approach when the non-stationary approach is suitably initialized.

引用

页码：61 / 71