Computing the Optimal Replenishment Policy for Inventory Systems with Random Discount Opportunities
Published Online:1 Oct 2001https://doi.org/10.1287/opre.49.5.790.10613
References
- Fractional Programming (1988) (Heldermann, Berlin) Google Scholar
- Coordinated replenishment in a multi-item inventory system with compound Poisson demands. Management Sci. (1984) 30:344–357Link, Google Scholar
- A simple and efficient algorithm for computing optimal (r, R) policies in continuous review inventory systems. Oper. Res. (1992) 40:384–403Link, Google Scholar
- An efficient algorithm for computing optimal policies. Oper. Res. (1984) 32:1268–1285Link, Google Scholar
- How should the (s, S) inventory policy be changed if there is a random discount opportunity?. (1996a) . Technical Report, Department of Decision Sciences, National University of SingaporeGoogle Scholar
- Is a discount worth waiting for?. (1996b) . Technical Report, Department of Decision Sciences, National University of SingaporeGoogle Scholar
- Inventory control with random and regular replenishment. J. of Indust. Engrg. (1968) 19:380–385Google Scholar
- Replenishment and stocking policies for inventory systems with random deal offerings. Management Sci. (1997) 43:334–342Link, Google Scholar
- A control system for coordinated inventory replenishment. Inter. J. Prod. Res. (1974) 12:647–671Crossref, Google Scholar
- Random opportunities for reduced cost replenishments. IIE Trans. (1993) 25:111–120Crossref, Google Scholar
- Inventory control in a fluctuating demand environment. Oper. Res. (1993) 41:351–370Link, Google Scholar
- Optimal control policy for stochastic inventory system with Markovian discount opportunities. Oper. Res. (1994) 42:721–738Link, Google Scholar

