Abstract
In the Joint Replenishment Problem (JRP), the goal is to coordinate the replenishments of a collection of goods over time so that continuous demands are satisfied with minimum overall ordering and holding costs. We consider the case when demand rates are constant. Our main contribution is the first hardness result for any variant of JRP with constant demands. When replenishments per commodity are required to be periodic and the time horizon is infinite (which corresponds to the so-called general integer model with correction factor), we show that finding an optimal replenishment policy is at least as hard as integer factorization. This result provides the first theoretical evidence that the JRP with constant demands may have no polynomial-time algorithm and that relaxations and heuristics are called for. We then show that a simple modification of an algorithm by Wildeman et al. (1997) for the JRP gives a fully polynomial-time approximation scheme for the general integer model (without correction factor). We also extend their algorithm to the finite horizon case, achieving an approximation guarantee asymptotically equal to \(\sqrt{9/8}\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arkin, E., Joneja, D., Roundy, R.: Computational complexity of uncapacitated multi-echelon production planning problems. Operations Research Letters 8, 61–66 (1989)
Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Annals of Mathematics 160(2), 781–793 (2004)
Goyal, S., Satir, A.: Joint replenishment inventory control: Deterministic and stochastic models. European Journal of Operational Research 38(1), 2–13 (1989)
Jackson, P., Maxwell, W., Muckstadt, J.: The joint replenishment problem with a powers-of-two restriction. IIE Transactions 17(1), 25–32 (1985)
Joneja, D.: The joint replenishment problem: New heuristics and worst case performance bounds. Operations Research 38(4), 711–723 (1990)
Khouja, M., Goyal, S.: A review of the joint replenishment problem literature: 1989-2005. European Journal of Operational Research 186(1), 1–16 (2008)
Kaspi, M., Rosenblatt, M.: On the economic ordering quantity for jointly replenished items. International Journal of Production Research 29(1), 107–114 (1991)
Levi, R., Roundy, R., Shmoys, D.: Primal-dual algorithms for deterministic inventory problems. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 353–362. ACM, New York (2004)
Lee, F.C., Yao, M.J.: A global optimum search algorithm for the joint replenishment problem under power-of-two policy. Computers & Operations Research 30(9), 1319–1333 (2003)
Moon, I.K., Cha, B.C.: The joint replenishment problem with resource restriction. European Journal of Operational Research 173(1), 190–198 (2006)
Muckstadt, J., Roundy, R.: Analysis of multistage production systems. In: Rinnooy, A., Zipkin, P. (eds.) Handbooks in Operations Research and Management Science, vol. 4, North-Holland, Amsterdam (1993)
Porras, E., Dekker, R.: Generalized solutions for the joint replenishment problem with correction factor. International Journal of Production Economics 113(2), 834–851 (2008)
Posner, M.E.: Approximation procedures for the one-warehouse multi-retailer system. Management Science 40(10), 1305–1316 (1994)
Roundy, R.: 98%-effective integer-ratio lot-sizing for one-warehouse multi-retailer systems. Management Science 31(11), 1416–1430 (1985)
Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2), 120–126 (1978)
Teo, C., Bertsimas, D.: Multistage lot sizing problems via randomized rounding. Operations Research 49(4), 599–608 (2001)
Wildeman, R., Frenk, J., Dekker, R.: An efficient optimal solution method for the joint replenishment problem. European Journal of Operational Research 99(2), 433–444 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schulz, A.S., Telha, C. (2011). Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands. In: Demetrescu, C., Halldórsson, M.M. (eds) Algorithms – ESA 2011. ESA 2011. Lecture Notes in Computer Science, vol 6942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23719-5_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-23719-5_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23718-8
Online ISBN: 978-3-642-23719-5
eBook Packages: Computer ScienceComputer Science (R0)