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

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)O(nT3) time, where n is the number of demands and T is the length of the planning horizon.