Can-order policy for the periodic-review joint replenishment problem
S G Johansen () and
P Melchiors
Additional contact information
S G Johansen: University of Aarhus
P Melchiors: University of Aarhus
Journal of the Operational Research Society, 2003, vol. 54, issue 3, 283-290
Abstract:
Abstract In this paper we study the stochastic joint replenishment problem. We compare the class of periodic replenishment policies and the class of can-order policies for this problem. We present a method, based on Markov decision theory, to calculate near-optimal can-order policies for a periodic-review inventory system. Our numerical study shows that the can-order policy behaves as well as, if not better than, the periodic replenishment policies. In particular, for examples where the demand is irregular, we find cost differences up to 15% in favour of the can-order policy.
Keywords: inventory control; joint replenishment; can-order policy; Markov processes (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (14)
Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601499 Abstract (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:pal:jorsoc:v:54:y:2003:i:3:d:10.1057_palgrave.jors.2601499
Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274
DOI: 10.1057/palgrave.jors.2601499
Access Statistics for this article
Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook
More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().