Optimal (r, nQ, T) batch-ordering policy under stationary demand
From MaRDI portal
Publication:5497458
DOI10.1080/00207721.2011.555010zbMath1307.93459OpenAlexW2100671430MaRDI QIDQ5497458
Ioannis T. Christou, A. G. Lagodimos, Konstantina Skouri
Publication date: 4 February 2015
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207721.2011.555010
Related Items (2)
Optimal \((r,nQ,T)\) batch ordering with quantized supplies ⋮ Computing optimal \((R, s, S)\) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming
Cites Work
- Unnamed Item
- Inventory models with continuous, stochastic demands
- Semi-stationary clearing processes
- Developing a closed-form cost expression for an \((R,s,nQ)\) policy where the demand process is compound generalized Erlang
- A Family of Inventory Models
- Computing optimal (s, S) policies in inventory models with continuous demands
- Inventory Service-Level Measures: Convexity and Approximation
- Inventory policies with quantized ordering
- On Properties of Stochastic Inventory Systems
- Computing Optimal (s, S) Inventory Policies
- The Optimal Inventory Policy for Batch Ordering
- The Status of Mathematical Inventory Theory
This page was built for publication: Optimal (r, nQ, T) batch-ordering policy under stationary demand