时间窗需求下供应商管理库存补货及发货动态批量研究  

Dynamic lot-sizing policy of replenishment and dispatch in the VMI supply chain with time window demand

作　　者：汪小京[1] 刘志学[1] 刘丹[1] 

机构地区：[1]华中科技大学管理学院,湖北武汉430074

出　　处：《计算机集成制造系统》2010年第7期1505-1514,共10页Computer Integrated Manufacturing Systems

基　　金：国家自然科学基金资助项目(70672039)~~

摘　　要：研究了一个有限计划期内、需求带有时间窗约束的供应商管理库存供应链的补货及发货动态批量问题。考虑了两种发货运输方式,即自营物流运输和采用第三方物流运输,并提出了相应的两种多项式算法寻找供应商最优的补货及发货策略。当采用自营物流运输方式时,假设发货成本是发货量的阶梯函数,且每个时间窗内的需求必须被一次发货批量满足,该问题为NP难题。因此,假设每个时间窗内的需求允许被多次发货批量满足,且时间窗约束结构一致,提出了一种多项式算法寻找供应商最优的补货及发货策略,其计算复杂度为O(T4)。当采用TPL运输方式时,发货成本是发货量的线性增函数,且在任意的时间窗约束下,提出了一种复杂度为O(T3)的算法寻找供应商最优的补货及发货策略。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.

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

分 类 号：F224.33[经济管理—国民经济] F253.4