DSpace Repository

Analysis of the Uncapacitated Dynamic Lot Size Problem

Show simple item record

dc.creator Britan, Gabriel R.
dc.creator Magnanti, Thomas L.
dc.creator Yanasse, Horacio H.
dc.date 2004-05-28T19:26:43Z
dc.date 2004-05-28T19:26:43Z
dc.date 1982-03
dc.date.accessioned 2013-10-09T02:38:08Z
dc.date.available 2013-10-09T02:38:08Z
dc.date.issued 2013-10-09
dc.identifier http://hdl.handle.net/1721.1/5179
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description 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.
dc.format 1500166 bytes
dc.format application/pdf
dc.language en_US
dc.publisher Massachusetts Institute of Technology, Operations Research Center
dc.relation Operations Research Center Working Paper;OR 113-82
dc.title Analysis of the Uncapacitated Dynamic Lot Size Problem
dc.type Working Paper


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account