Abstract
We address the stochastic lot sizing problem with piecewise linear concave ordering costs. The problem is very common in practice since it relates to a variety of settings involving quantity discounts, economies of scales, and use of multiple suppliers. We herein focus on implementing the (R,S) policy for the problem under consideration. This policy is appealing from a practical point of view because it completely eliminates the setup-oriented nervousness – a pervasive issue in inventory control. In this paper, we first introduce a generalized version of the (R,S) policy that accounts for piecewise linear concave ordering costs and develop a mixed integer programming formulation thereof. Then, we conduct an extensive numerical study and compare the generalized (R,S) policy against the cost-optimal generalized (s,S) policy. The results of the numerical study reveal that the (R,S) policy performs very well – yielding an average optimality gap around 1%.
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.
