Determining the optimal order quantity with compound Erlang demand under \((T, Q)\) policy
From MaRDI portal
Publication:1721165
DOI10.1155/2018/6085342zbMath1427.90015OpenAlexW2885865595MaRDI QIDQ1721165
Yingzi Bao, Jialing Lu, Kwok Leung Tam, Ai-Ping Jiang
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/6085342
Cites Work
- Analysis of order-up-to-level inventory systems with compound Poisson demand
- Analysis and evaluation of an assemble-to-order system with batch ordering policy and compound Poisson demand
- Control of inventories with intermittent demand
- On the \((R,s,Q)\) inventory model when demand is modelled as a compound Bernoulli process
- Developing a closed-form cost expression for an \((R,s,nQ)\) policy where the demand process is compound generalized Erlang
- The distribution-free newsboy problem under the worst-case and best-case scenarios
- Probability and Statistical Models
- Forecasting for the ordering and stock-holding of spare parts
- A comparison between the order and the volume fill rate for a base-stock inventory control system under a compound renewal demand process
- On the (S – 1, S) Stock Model for Renewal Demand Processes: Poisson's poison
- Inventory control
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Determining the optimal order quantity with compound Erlang demand under \((T, Q)\) policy
