Article ID: | iaor201525337 |
Volume: | 65 |
Issue: | 12 |
Start Page Number: | 1853 |
End Page Number: | 1863 |
Publication Date: | Dec 2014 |
Journal: | Journal of the Operational Research Society |
Authors: | Bijvank Marco |
Keywords: | service |
Full‐cost inventory models are mostly studied in the literature, whereas service level constraints are more common to be observed in practical settings. In this paper, we consider periodic review inventory systems with service level restrictions. The control of such inventory systems is limited to (s, S)‐type policies in the literature. To the best of our knowledge, we are the first authors to compare such policies with optimal replenishment policies, and illustrate an average cost difference of 0.64%. This justifies the use of these popular (s, S) policies in practice. Furthermore, we propose a new one‐dimensional search procedure that is bounded to set the reorder level s and order‐up‐to level S, whereas the solution space is unbounded and two dimensional. Our heuristic procedure is guaranteed to satisfy the service level constraint and numerical experiments illustrate that it results in an average cost deviation of 1–2% compared with the best (s, S) policy. Consequently, it significantly outperforms all existing procedures from literature, both in service and costs.