Skip to main content
Log in

The joint replenishment problem with quantity discounts under constant demand

  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract.

In many practical situations quantity discounts on basic purchase price exist, and taking advantage of these can result in substantial savings. Quantity discounts have been considered in many production and inventory models. But unlike other research areas, there have been no studies to quantity discounts in the joint replenishment problem. The purpose of this paper is to develop efficient algorithms for solving this problem. Firstly, we suggest useful propositions to develop efficient heuristic algorithms. Secondly, we develop two algorithms using these propositions. Numerical examples are shown to illustrate the procedures of these algorithms. Extensive computational experiments are performed to analyze the effectiveness of the heuristics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to I. K. Moon.

Additional information

The authors are grateful to the editor and two anonymous referees for their valuable comments on earlier versions of this paper. This work was supported by “Research Center for Logistics Information Technology (LIT)” hosted by the Ministry of Education and Human Resources Development in Korea.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cha, B.C., Moon, I.K. The joint replenishment problem with quantity discounts under constant demand. OR Spectrum 27, 569–581 (2005). https://doi.org/10.1007/s00291-005-0196-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-005-0196-8

Keywords:

Navigation