Ordering policies for multi-item inventory systems subject to multiple resource constraints

We study the multi-item inventory problem with multiple resource constraints. For the simplified variant of this problem with a single resource constraint, known heuristic solution approaches assume independent cycles, fixed cycles, and non-stationary order quantities. For the multiple constraint problem, however, only independent cycle solution algorithms exist in the literature. In this paper, we devise both fixed cycle and non-stationary approaches to the multiple constraint problem, and give computational results showing their potential cost-effectiveness over independent cycle methods.