A Simple Heuristic for Computing Nonstationary (s, S) Policies

References

• Askin R. G. A procedure for production lot sizing with probabilistic dynamic demand. AIIE Trans. (1981) 13(2):132–137Crossref, Google Scholar
• Iglehart D. L., Scarf H. E., Gilford D. M., Shelley M. W. Dynamic programming and stationary analysis of inventory problems. Multistage Inventory Models and Techniques (1963) (Stanford University Press, Stanford, CA) Google Scholar
• Scarf H., Arrow K. J., Karlin S., Suppes P. The optimality of (S, s)policies in dynamic inventory problem. Mathematical Methods in Social Sciences, 1959 (1960) (Stanford University Press, Stanford, CA) Google Scholar
• Silver E. Inventory control under a probabilistic time varying demand pattern. AIIE Trans. (1978) 10(4):371–379Crossref, Google Scholar
• Silver E. A., Meal H. C. A heuristic for selecting lot size requirements for the case of a deterministic timevarying demand rate and discrete opportunities for replenishment. Production and Inventory Management (1973) 14(2):64–74Google Scholar
• Veinott A. F., Wagner H. M. Computing optimal (s, S)inventory policies. Management Sci. (1965) 11(5):525–552Link, Google Scholar
• Wagner H. M., Whitin T. M. Dynamic version of the economic lot size model. Management Sci. (1958) 5:89–96Link, Google Scholar
• Zheng Y. A simple proof for optimality of (s, S)policies in infinite-horizon inventory systems. J. Appl. Probab. (1991) 28:802–810Crossref, Google Scholar
• Zheng Y., Federgruen A. Finding optimal (s, S)policies is about as simple as evaluating a single policy. Oper. Res. (1991) 39(4):654–665Link, Google Scholar