Dynamic lot-sizing model with demand time windows and speculative cost structure

Dynamic lot-sizing model with demand time windows and speculative cost structure

0.00 Avg rating—0 Votes
Article ID: iaor20062592
Country: Netherlands
Volume: 34
Issue: 3
Start Page Number: 251
End Page Number: 256
Publication Date: May 2006
Journal: Operations Research Letters
Authors: ,
Keywords: programming: dynamic
Abstract:

We consider a deterministic lot-sizing problem with demand time windows, where speculative motive is allowed. Utilizing an untraditional decomposition principle, we provide an optimal algorithm that runs in O(nT3) time, where n is the number of demands and T is the length of the planning horizon.

Reviews

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