Modeling lot-size with time-dependent demand based on stochastic programming and case study of drug supply in Chile

Fernando Rojas, Víctor Leiva, Peter Wanke, Camilo Lillo and Jimena Pascual

PLOS ONE, 2019, vol. 14, issue 3, 1-24

Abstract: The objective of this paper is to propose a lot-sizing methodology for an inventory system that faces time-dependent random demands and that seeks to minimize total cost as a function of order, purchase, holding and shortage costs. A two-stage stochastic programming framework is derived to optimize lot-sizing decisions over a time horizon. To this end, we simulate a demand time-series by using a generalized autoregressive moving average structure. The modeling includes covariates of the demand, which are used as predictors of this. We describe an algorithm that summarizes the methodology and we discuss its computational framework. A case study with unpublished real-world data is presented to illustrate the potential of this methodology. We report that the accuracy of the demand variance estimator improves when a temporal structure is considered, instead of assuming time-independent demand. The methodology is useful in decisions related to inventory logistics management when the demand shows patterns of temporal dependence.

Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0212768 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 12768&type=printable (application/pdf)

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:plo:pone00:0212768

DOI: 10.1371/journal.pone.0212768

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().