MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Analysis of the Uncapacitated Dynamic Lot Size Problem

Author(s)
Britan, Gabriel R.; Magnanti, Thomas L.; Yanasse, Horacio H.
Thumbnail
DownloadOR-113-82.pdf (1.430Mb)
Metadata
Show full item record
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.
Date issued
1982-03
URI
http://hdl.handle.net/1721.1/5179
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 113-82

Collections
  • Operations Research Center Working Papers

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.