Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 207, Issue 3, Pages 1398-1409Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2010.07.003
Keywords
Lot sizing; Stochastic programming; Inventory bounds
Funding
- U.S. National Science Foundation [CMMI-0700868, CMMI-0748204]
- Center for Engineering Logistics and Distribution (CELDi)
- National Science Foundation
Ask authors/readers for more resources
In this paper, we study the stochastic version of lot-sizing problems with inventory bounds and order capacities. Customer demands, inventory bounds, and costs are subject to uncertainty and dependent with each other throughout the finite planning horizon. Two models in stochastic programming are developed: the first one has inventory-bound constraints, and the second one has both inventory-bound and order-capacity constraints. We explore structural properties of the two models and develop O(n(2)) and O(n(2)T log n) dynamic programming algorithms for them, respectively. Our model also generalizes the deterministic lot-sizing problem with inventory bounds. For some cases, when applied to the deterministic versions, our algorithms outperform existing deterministic algorithms. Published by Elsevier B.V.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available