On optimal algorithms for the joint replenishment problem

S Viswanathan ()
Additional contact information
S Viswanathan: Nanyang Business School, Nanyang Technological University

Journal of the Operational Research Society, 2002, vol. 53, issue 11, 1286-1290

Abstract: Abstract In this paper, we demonstrate that the algorithm for determining the optimal strict cyclic policy for the Joint Replenishment Problem suggested by Fung and Ma1 does not guarantee an optimal solution. We propose a modification that will ensure that the algorithm obtains the optimal strict cyclic policy. We then perform a comprehensive computational study to compare the modified Fung and Ma algorithm with other optimal algorithms for the problem. The study reveals that the optimal algorithm of Viswanathan2 is computationally more efficient than other methods.

Keywords: inventory; joint-replenishment; deterministic demand (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601445 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:53:y:2002:i:11:d:10.1057_palgrave.jors.2601445

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601445

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 ().