An Algorithm for the Multiple Lot Sizing Problem with Rigid Demand and Interrupted Geometric Yield

In this paper, we consider the multiple lot sizing problem with interrupted geometric yield distribution. In the literature, this problem has been modeled in a dynamic programming form, and a closed-form solution for an optimal lot size has not yet been discovered. Our aim here is to develop an algorithm to search for an optimal lot size for this problem. Numerical results show that our algorithm performs superior to Zhang and Guu’s algorithm. A closed-form solution of an optimal lot size has been proposed as well but for small demands and for special cases only.