Optimization of (s, S) Inventory Systems with Random Lead Times and a Service Level Constraint
A major assumption in the analysis of (s, S) inventory systems with stochastic lead times is that orders are received in the same sequence as they are placed. Even under this assumption, much of the work to date has focused on the unconstrained optimization of the system, in which a penalty cost for unsatisfied demand is assigned. The literature on constrained optimization, wherein a service level requirement needs to be met, is more sparse. In this paper, we consider the constrained optimization problem, where orders are allowed to cross in time. We propose a feasible directions procedure that is simulation based, and present computational results for a large number of test cases. In the vast majority of cases, we come within 5% of estimated optimality.
Volume (Year): 44 (1998)
Issue (Month): 12-Part-2 (December)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Tijms, H. C. & Groenevelt, H., 1984. "Simple approximations for the reorder point in periodic and continuous review (s, S) inventory systems with service level constraints," European Journal of Operational Research, Elsevier, vol. 17(2), pages 175-190, August.
- Helmut Schneider & Jeffrey L. Ringuest, 1990. "Power Approximation for Computing (s, S) Policies Using Service Level," Management Science, INFORMS, vol. 36(7), pages 822-834, July.
- Pierre L'Ecuyer & Nataly Giroux & Peter W. Glynn, 1994. "Stochastic Optimization by Simulation: Numerical Experiments with the M/M/1 Queue in Steady-State," Management Science, INFORMS, vol. 40(10), pages 1245-1261, October.