We consider a dynamic lot-sizing problem for delivery of a single item under the situation that storage capacity is limited. We first formulate the problem and provide an optimality property. For this problem, a main dynamic programming procedure is p...
We consider a dynamic lot-sizing problem for delivery of a single item under the situation that storage capacity is limited. We first formulate the problem and provide an optimality property. For this problem, a main dynamic programming procedure is proposed, which utilizes the zero inventory policy.