A perfect lot-tree procedure for the discounted dynamic lot-size problem with speculation

A perfect lot-tree procedure for the discounted dynamic lot-size problem with speculation

0.00 Avg rating0 Votes
Article ID: iaor199335
Country: United States
Volume: 39
Issue: 5
Start Page Number: 651
End Page Number: 668
Publication Date: Aug 1992
Journal: Naval Research Logistics
Authors:
Abstract:

This article considers the dynamic lot-size problem under discounting, allowing a speculative motive for holding inventory. A forward procedure is developed that determines the first lot-size decision in a rolling horizon environment by using forecast data of the minimum possible number of future periods.

Reviews

Required fields are marked *. Your email address will not be published.