Storage-Space Capacitated Inventory System with ( r, Q ) Policies

Xiaobo Zhao (), Fan Fan (), Xiaoliang Liu () and Jinxing Xie ()
Additional contact information
Xiaobo Zhao: Department of Industrial Engineering, Tsinghua University, Beijing 100084, China
Fan Fan: Department of Industrial Engineering, Tsinghua University, Beijing 100084, China
Xiaoliang Liu: Department of Industrial Engineering, Tsinghua University, Beijing 100084, China
Jinxing Xie: Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China

Operations Research, 2007, vol. 55, issue 5, 854-865

Abstract: We deal with an inventory system with limited storage space for a single item or multiple items. For the single-item system, customers' demand is stochastic. The inventory is controlled by a continuous-review ( r, Q ) policy. Goods are replenished to the inventory system with a constant lead time. An optimization problem with a storage-space constraint is formulated for computing a single-item ( r, Q ) policy that minimizes the long-run average system cost. Based on some existing results in the single-item ( r, Q ) policy without a storage-space constraint in the literature, useful structural properties of the optimization problem are attained. An efficient algorithm with polynomial time computational complexity is then proposed for obtaining the optimal solutions. For the multi-item system, each item possesses its particular customers' demand that is stochastic, its own ( r, Q ) policy that controls the inventory, and its individual lead time that is constant. An important issue in such inventory systems is the allocation of the storage space to the items and the values of r and Q for each item. We formulate an optimization problem with a storage-space constraint for multi-item ( r, Q ) policies. Based on the results in the single-item ( r, Q ) policy with a storage-space constraint, we find useful structural properties of the optimization problem. An efficient algorithm with polynomial time computational complexity is then proposed for obtaining undominated solutions.

Keywords: inventory/production; (r; Q) policy; stochastic demand; programming; storage-space constraint; algorithm (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1070.0394 (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:inm:oropre:v:55:y:2007:i:5:p:854-865

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().