Article thumbnail

Approximation Methods for the Uncapacitated Dynamic Lot Size Problem

By Gabriel R. Bitran, Thomas L. Magnanti and Horacio H. Yanasse

Abstract

We provide worst case error bounds for several approximation methods (heuristics, product aggregation, and partitioning of the planning horizon) for the uncapacitated dynamic lot size problem. We propose two managerially oriented heuristics and show that they have a relative wont case error bound equal to two, and develop similar analyses for methods known as the least cost per unit heuristic, the part period balancing heuristic, and an economic order quantity heuristic (expressed in terms of a time supply of demand). We also show how errors introduced by partitioning of the planning horizon in multi-product multi-facility problems are bounded by product set-up costs, and how errors introduced by product aggregation are bounded by set-up costs, holding costs, and demands. The latter results suggest methods for product aggregation that minimize the worst case error bounds.inventory/production: lot sizing

DOI identifier: 10.1287/mnsc.30.9.1121
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://dx.doi.org/10.1287/mnsc... (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles