Abstract
A complete computational approach for finding optimal (s, S) inventory policies is developed. The method is an efficient and unified approach for all values of the model parameters, including a non-negative set-up cost, a discount factor 0 ≦ α ≦ 1, and a lead time. The method is derived from renewal theory and stationary analysis, generalized to permit the unit interval range of values for α. Careful attention is given to the problem associated with specifying a starting condition (when α < 1); a resolution is found that guarantees an (s, S) policy optimal for all starting conditions is produced by the computations. New upper and lower bounds on the optimal values of both s and S are established. The special case of linear holding and penalty costs is treated in detail. In the final section, a model in which there is a minimum guaranteed demand in each period is studied, and a simplified method of solution is developed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
