On Solving a Stochastic Programming Model for Perishable Inventory Control
This paper describes and analyses a Stochastic Programming (SP) model that is used for a specific inventory control problem for a perishable product. The decision maker is confronted with a non-stationary random demand for a fixed shelf life product and wants to make an ordering plan for a finite horizon that satisfies a service level constraint. In literature several approaches have been described to generate approximate solutions. The question dealt with here is whether exact approaches can be developed that generate solutions up to a guaranteed accuracy. Specifically, we look into the implications of a Stochastic Dynamic Programming (SDP) approach.
KeywordsStochastic Programming Dynamic Programming Inventory control Perishable products Service level constraint
Unable to display preview. Download preview PDF.
- 1.Bellman, R.: Dynamic Programming. Princeton University Press (1957)Google Scholar
- 2.Blake, J.T., Thompson, S., Smith, S., Anderson, D., Arellano, R., Bernard, D.: Using dynamic programming to optimize the platelet supply chain in nova scotia. In: Dlouhý, M., Prague, C.R.O. (eds.) Proceedings of the 29th Meeting of the European Working Group on Operational Research Applied to Health Services, pp. 47–65 (2003)Google Scholar
- 6.Howard, R.A.: Dynamic Programming and Markov Processes. MIT Press, Cambridge University (1960)Google Scholar
- 7.Karaesmen, I., Scheller-Wolf, A., Deniz, B.: Planning Production and Inventories in the Extended Enterprise. In: Managing Perishable and Aging Inventories: Review and Future Research Directions. International Series in Operations Research & Management Science, vol. 151, ch. 15, pp. 393–436. Springer (2011)Google Scholar
- 9.Pauls-Worm, K.G.J., Rossi, R., Haijema, R., Hendrix, E.M.T.: Non-stationary inventory control for a perishable product. OR Spektrum (2012)Google Scholar