Approximated closed-form minimum-cost solutions to the \((S-1,S)\) policy with complete backordering (Q2204185)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximated closed-form minimum-cost solutions to the \((S-1,S)\) policy with complete backordering |
scientific article |
Statements
Approximated closed-form minimum-cost solutions to the \((S-1,S)\) policy with complete backordering (English)
0 references
15 October 2020
0 references
Summary: In this paper, we consider the continuous review \((S-1,S)\) policy with complete backordering, deterministic and constant lead-time, and with a Poissonian lead-time demand. Moreover, we take into account two different expressions of the total expected cost depending on the customer-service criterion adopted. First, we approximate the Poissonian lead-time demand with a well-suited Gaussian random variable. Although this system can be easily solved with a simple algorithmic approach, it is interesting to be aware of the direct analytical functional relationship between the optimal value of the decision variable and the parameters of the model. Hence, the second step consists in providing some approximated closed-form minimum-cost solutions for both cost models considered under a Gaussian lead-time demand. An extensive numerical study is finally shown to characterise the precision achieved by the approximations developed.
0 references
inventory policy
0 references
base-stock policy
0 references
nonlinear programming
0 references
logistic function
0 references
approximation
0 references
Gaussian lead-time demand
0 references
closed-form solutions
0 references
minimum-cost solutions
0 references
complete backordering
0 references
inventory management
0 references
continuous review policy
0 references
lead times
0 references