A Few Remarks on the Assortment Problem
The paper deals with the assortment problem in a particular case -- that of structural steel beams. Using the dynamic programming technique we show that this assortment problem is equivalent to the economic lot size problem and also to the routing problem.
|Date of creation:||1959|
|Date of revision:|
|Publication status:||Published in Management Science (October 1959), 6(1): 13-24|
|Contact details of provider:|| Postal: Yale University, Box 208281, New Haven, CT 06520-8281 USA|
Phone: (203) 432-3702
Fax: (203) 432-6167
Web page: http://cowles.yale.edu/
More information through EDIRC
|Order Information:|| Postal: Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA|
When requesting a correction, please mention this item's handle: RePEc:cwl:cwldpp:67. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Matthew C. Regan)
If references are entirely missing, you can add them using this form.