Dynamic lot-sizing problem with demand time windows and container-based transportation cost

Dynamic lot-sizing problem with demand time windows and container-based transportation cost

0.00 Avg rating0 Votes
Article ID: iaor2009207
Country: Germany
Volume: 2
Issue: 1
Start Page Number: 39
End Page Number: 51
Publication Date: Jan 2008
Journal: Optimization Letters
Authors: ,
Keywords: inventory
Abstract:

In this paper, we study the dynamic lot-sizing problem with demand time windows and container-based transportation cost. For each particular demand, there are corresponding earliest and latest times, and the duration between such earliest and latest times is the demand time window. If a demand is satisfied by a delivery within demand time window, then there is no holding or backlogging cost incurred. Our purpose is to satisfy demand at a minimum total cost, including setup cost, procurement cost, container cost, and inventory holding cost.

Reviews

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