A tutorial to set safety stock under guaranteed-service time by dynamic programming

Luis A. Moncayo-Martínez and Adan Ramirez-López

International Journal of Industrial and Systems Engineering, 2016, vol. 24, issue 4, 490-509

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.

Keywords: supply chain management; SCM; safety stock levels; guaranteed service time; dynamic programming; industrial logistics; tutorial. (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=80286 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:24:y:2016:i:4:p:490-509

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().