Classical MRP (Material Requirements Planning) systems equipped with lot sizing schemes assumes that available capacities are not limited. In reality, however, this assumption cannot in general be accepted.
This paper studies a work load smoothing algorithm as applied to MRP schemes. This algorithm finds cost saving order guantities and order release times. Input to this method is the set of order quantities and release times as determined by MRP schemes with lot sizing.
A case study is presented to illustrate applicability of the proposed algorithm.
