Algorithms and heuristics for variable-yield lot sizing

Abstract

We consider the multiperiod lot-sizing problem in which the production yield (the proportion of usable goods) is variable according to a known probability distribution. We review two economic order quantity (EOQ) models for the stationary demand continuous-time problem and derive an EOQ model when the production yield follows a binomial distribution and backlogging of demand is permitted. A dynamic programming algorithm for an arbitrary sequence of demand requirements is presented. Heuristics based on both the EOQ model and appropriate modification of the underlying perfect-yield lot-sizing policies are discussed, and extensive computational evaluation of these heuristics is presented. Two of these heuristics are then modified to include the notion of supply safety stock. The modified heuristics consistently produce near-optimal lot-sizing policies for problems with stationary and time-varying demands.