A tutorial to set safety stock under guaranteed-service time by dynamic programming Online publication date: Fri, 11-Nov-2016
by Luis A. Moncayo-Martínez; Adan Ramirez-López
International Journal of Industrial and Systems Engineering (IJISE), Vol. 24, No. 4, 2016
Abstract: In this paper, we provide a tutorial to solve the problem of minimising the safety stock levels under guaranteed-service time over a supply chain (SC) using the dynamic programming (DP) algorithm proposed by Graves and Willems (2000a). We solve a small instance to exemplify the steps of the DP algorithm, then we solve two bigger instances by a Java-based application. As the DP algorithm has some insights that must be explained in detail to carry it out, the novelty and helpfulness of this tutorial lies in the fact that we account for those insights which lead researchers to develop new algorithms to solve bigger instances. This problem is included in some state-of-the-art SC books but none gives details about the solution algorithm as we do in this tutorial.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com