Analysis of the Uncapacitated Dynamic Lot Size Problem
Name
OR-113-82.pdf
Size
1.43 MB
Format
Adobe PDF
Checksum (MD5)
8e7c76d081d6fec16d64b64553d9bd19
Author(s)
Britan, Gabriel R.
Magnanti, Thomas L.
Yanasse, Horacio H.
Date Issued
March 1982
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 113-82
Abstract
In this paper we provide worst case error bounds for several heuristics for the uncapacitated dynamic lot size problem. We propose two managerially oriented procedures and show that they have a relative worst case error bound equal to two, and develop similar analyses for methods known as the "Silver and Meal" heuristics, the part period balancing heuristics, and economic order quantity heuristics (expressed in terms of a time supply of demand).We also present results on aggregation and partitioning of the planning horizon.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
