关键词: 供应商管理库存, 时间窗, 动态批量, 自营物流, 第三方物流, 供应链

Abstract: Dynamic lot-sizing problem of the replenishment and dispatch policy in the Vendor-Managed-Inventory (VMI) supply chain with time windows in the finite time-horizon was studied. Considering two transportation modes (by the private logistics, and by third-party logistics), two polynomial algorithm for computing the optimal solution for each transportation mode were proposed respectively. When the vendor adopted the private logistics, the dispatch cost was a stepwise function in the transportation quantity, and if each demand must be satisfied by only one dispatch, the problem was NP-hard. Therefore, it was assumed that the demand could be supplied by several consecutive dispatches, and the time windows satisfying the agreeable structure, a polynomial algorithm for the optimal solution with time complexity O（T4）was proposed. When the vendor adopted the TPL, the dispatch cost was a linear function in the transportation quantity, a polynomial algorithm for optimal solution under any time windows with time complexity O（T3）was put forward.

Key words: vendor-managed inventory, time window, dynamic lot-sizing, private logistics, third-party logistics, supply chains