No open-access location is known for this record yet.
No open-access location is known for this record yet.
We consider inventory policies for a continuous review system with discrete compound Poisson demand, convex holding-penalty cost and fixed order cost. Beckmann has showri that under these conditions (s, S) policies are optimal. We develop recursive formulae to calculate the cost for any pair (s, S). Relations among s, S, S − s and the cost are produced that lead to an efficient determination of the optimal s and S. Tighter bounds are utilized than those obtained by Veinott and Wagner for the analogous case of periodic review. Sensitivity considerations are discussed.
Loading…
Stored only when both papers are in the corpus — 115 citations exist upstream.
Papers that cite the same references — the relational fallback while embeddings are still backfilling.
Imported from OpenAlex (CC0) — nothing here is generated.